Procs
proc dijkstra(G`gensym5: DynamicGraph[int] or StaticGraph[int]; start`gensym5: int or seq[int]; ZERO`gensym5: int = 0; INF`gensym5: int = INF64): auto
- Source Edit
proc dijkstra(G`gensym6: DynamicGraph[int32] or StaticGraph[int32]; start`gensym6: int or seq[int]; ZERO`gensym6: int32 = 0'i32; INF`gensym6: int32 = INF32): auto
- Source Edit
proc dijkstra(G`gensym7: DynamicGraph[float] or StaticGraph[float]; start`gensym7: int or seq[int]; ZERO`gensym7: float = 0.0; INF`gensym7: float = 1e+100): auto
- Source Edit
proc dijkstra[T](G: DynamicGraph[T] or StaticGraph[T]; start: int or seq[int]; ZERO, INF: T): auto
- Source Edit
proc restore_dijkstra(G`gensym2: DynamicGraph[int] or StaticGraph[int]; start`gensym2: int or seq[int]; ZERO`gensym2: int = 0; INF`gensym2: int = INF64): auto
- Source Edit
proc restore_dijkstra(G`gensym3: DynamicGraph[int32] or StaticGraph[int32]; start`gensym3: int or seq[int]; ZERO`gensym3: int32 = 0'i32; INF`gensym3: int32 = INF32): auto
- Source Edit
proc restore_dijkstra(G`gensym4: DynamicGraph[float] or StaticGraph[float]; start`gensym4: int or seq[int]; ZERO`gensym4: float = 0.0; INF`gensym4: float = 1e+100): auto
- Source Edit
proc restore_dijkstra[T](G: DynamicGraph[T] or StaticGraph[T]; start: int or seq[int]; ZERO, INF: T): auto
- Source Edit
proc shortest_path_dijkstra(G: DynamicGraph[int32] or StaticGraph[int32]; start: int; goal: int; ZERO: int32 = 0.int32; INF: int32 = INF32): tuple[path: seq[int], cost: int32]
- Source Edit
proc shortest_path_dijkstra(G: DynamicGraph[int] or StaticGraph[int]; start: int; goal: int; ZERO: int = 0; INF: int = INF64): tuple[path: seq[int], cost: int]
- Source Edit
proc shortest_path_dijkstra[T](G: DynamicGraph[T] or StaticGraph[T]; start: int; goal: int; ZERO: T; INF: T): tuple[ path: seq[int], cost: T]
- Source Edit