CPLIB_GRAPH_DIJKSTRA = 1

proc dijkstra(G`gensym6: DynamicGraph[int] or StaticGraph[int];
              start`gensym6: int or seq[int]; ZERO`gensym6: int = 0;
              INF`gensym6: int = INF64): auto

proc dijkstra(G`gensym7: DynamicGraph[int32] or StaticGraph[int32];
              start`gensym7: int or seq[int]; ZERO`gensym7: int32 = 0'i32;
              INF`gensym7: int32 = INF32): auto

proc dijkstra(G`gensym8: DynamicGraph[float] or StaticGraph[float];
              start`gensym8: int or seq[int]; ZERO`gensym8: float = 0.0;
              INF`gensym8: float = 1e+100): auto

proc dijkstra(G`gensym9: DynamicGraph[float32] or StaticGraph[float32];
              start`gensym9: int or seq[int]; ZERO`gensym9: float32 = 0.0'f32;
              INF`gensym9: float32 = 1e+30'f32): auto

proc dijkstra[T](G: DynamicGraph[T] or StaticGraph[T]; start: int or seq[int];
                 ZERO, INF: T): auto

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

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

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

proc restore_dijkstra(G`gensym5: DynamicGraph[float32] or
    StaticGraph[float32]; start`gensym5: int or seq[int];
                      ZERO`gensym5: float32 = 0.0'f32;
                      INF`gensym5: float32 = 1e+30'f32): auto

proc restore_dijkstra[T](G: DynamicGraph[T] or StaticGraph[T];
                         start: int or seq[int]; ZERO, INF: T): auto

proc shortest_path_dijkstra(G: DynamicGraph[float32] or StaticGraph[float32];
                            start: int; goal: int; ZERO: float32 = 0.0'f32;
                            INF: float32 = 1e+30'f32): tuple[path: seq[int],
    cost: float32]

proc shortest_path_dijkstra(G: DynamicGraph[float] or StaticGraph[float];
                            start: int; goal: int; ZERO: float = 0.0;
                            INF: float = 1e+100): tuple[path: seq[int],
    cost: float]

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]

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]

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]