CPLIB_GRAPH_MAXK_DIJKSTRA = 1

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

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

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

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

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

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

proc shortest_path_maxk_dijkstra(G: DynamicGraph[int32] or StaticGraph[int32];
                                 start, goal: int; k: int32;
                                 ZERO: int32 = 0.int32; INF: int = INF32): tuple[
    path: seq[int], cost: int]

proc shortest_path_maxk_dijkstra(G: DynamicGraph[int] or StaticGraph[int];
                                 start, goal: int; k: int; ZERO: int = 0;
                                 INF: int = INF64): tuple[path: seq[int],
    cost: int]

proc shortest_path_maxk_dijkstra[T](G: DynamicGraph[T] or StaticGraph[T];
                                    start, goal: int; k, ZERO, INF: T): tuple[
    path: seq[int], cost: T]