Versions in this module Expand all Collapse all v2 v2.0.8 Dec 3, 2024 v2.0.7 Dec 3, 2024 v2.0.6 Nov 29, 2024 v2.0.5 Nov 18, 2024 v2.0.4 Nov 12, 2024 v2.0.3 Nov 12, 2024 Changes in this version + type IEdgeWeight interface + GetRuntimeEdgeWeight func(ET, []float64, int, []mapv2.SublineType) float64 v2.0.2 Oct 31, 2024 v2.0.1 Oct 30, 2024 v2.0.0 Sep 28, 2024 Changes in this version + const BACKWARD + const BUS + const FORWARD + const HEAD + const TAIL + const TIME_SLICE_INTERVAl + const TIME_SLICE_LENGTH + var ErrNoTDGraph = errors.New("no time dependent graph, should set edge length with length 1") + var ErrOutOfTimeSlice = errors.New("out of time slice, should be less than 288") + func InServiceTime(cost TazCost, time float64) bool + func StationTimeDependentCosts(cost float64, departureTimes []float64) []float64 + func TazCenterPoint(taz TazPair, xStep float64, yStep float64, xMin float64, yMin float64) geometry.Point + func TazDistance(taz1 TazPair, taz2 TazPair, xStep float64, yStep float64) float64 + func TimeToIndex(time float64) int + type BusEdgeAttr struct + FromID int32 + SublineID int32 + SublineType int + ToID int32 + type BusNodeAttr struct + CenterPoint geometry.Point + ID int32 + StationTAZCosts map[TazPair][]TazCost + SublineTazCosts map[int32][]TazCost + type DriveEdgeAttr struct + ID int32 + type DriveNodeAttr struct + ID int32 + IsAoi bool + type IHeuristics interface + HeuristicBus func(NT, []ET, geometry.Point, float64) float64 + HeuristicEuclidean func(geometry.Point, geometry.Point) float64 + type Item struct + Index int + Priority float64 + Value int + type PathItem struct + EdgeAttr ET + NodeAttr NT + type PriorityQueue []*Item + func (pq *PriorityQueue) Pop() any + func (pq *PriorityQueue) Push(x any) + func (pq PriorityQueue) Len() int + func (pq PriorityQueue) Less(i, j int) bool + func (pq PriorityQueue) Swap(i, j int) + type SearchGraph struct + func NewSearchGraph[NT any, ET any](isTD bool, h IHeuristics[NT, ET]) *SearchGraph[NT, ET] + func (g *SearchGraph[NT, ET]) GetEdgeLength(from, to int, tIndex int) float64 + func (g *SearchGraph[NT, ET]) GetEdgeLengthAndAttr(from, to int, tIndex int) (float64, ET) + func (g *SearchGraph[NT, ET]) InitEdge(from, to int, lengths []float64, attr ET) + func (g *SearchGraph[NT, ET]) InitNode(p geometry.Point, attr NT, noOut bool) int + func (g *SearchGraph[NT, ET]) SetEdgeLength(from, to int, tIndex int, length float64) error + func (g *SearchGraph[NT, ET]) SetEdgeLengths(from, to int, lengths []float64) error + func (g *SearchGraph[NT, ET]) ShortestPath(start, end int, curTime float64) ([]PathItem[NT, ET], float64) + func (g *SearchGraph[NT, ET]) ShortestPathAStar(start, end int, curTime float64) ([]PathItem[NT, ET], float64) + func (g *SearchGraph[NT, ET]) ShortestPathAStarToTaz(start int, endTaz TazPair, endP geometry.Point, sameTazDistance float64, ...) ([]PathItem[NT, ET], float64) + func (g *SearchGraph[NT, ET]) ShortestTAZPath(start int, endTaz TazPair, endP geometry.Point, ...) ([]PathItem[NT, ET], float64) + type TazCost struct + Cost float64 + SublineEndTime float64 + SublineID int32 + SublineStartTime float64 + TazPair TazPair + type TazPair struct + X int32 + Y int32 + func PointToNearTAZs(p geometry.Point, xStep float64, yStep float64, xMin float64, yMin float64) []TazPair + func PointToTaz(p geometry.Point, xStep float64, yStep float64, xMin float64, yMin float64) TazPair + type WalkLaneNode struct + NodeId int + S float64 + type WalkNodeAttr struct + ID int32 + IsAoi bool Other modules containing this package git.fiblab.net/sim/routing
Go to main page