Range_Edge_Graph[T] = ref object
  G*: WeightedDirectedGraph[T]
  n*: int
  baseLen*: int
  zero: T
  root: int
  nodes: seq[RangeEdgeGraphNode]

CPLIB_RANGE_EDGE_GRAPH = 1

proc add_edge[T](G: Range_Edge_Graph[T]; from_l, from_r, to_l, to_r: int;
                 cost: T)

proc add_edge[T](G: Range_Edge_Graph[T]; src, to: int; cost: T)

proc add_point_to_point_edge[T](G: Range_Edge_Graph[T]; src, to: int; cost: T)

proc add_point_to_range_edge[T](G: Range_Edge_Graph[T]; src, to_l, to_r: int;
                                cost: T)

proc add_range_to_point_edge[T](G: Range_Edge_Graph[T]; from_l, from_r, to: int;
                                cost: T)

proc add_range_to_range_edge[T](G: Range_Edge_Graph[T];
                                from_l, from_r, to_l, to_r: int; cost: T)

proc base_len[T](G: Range_Edge_Graph[T]): int

proc graph[T](G: Range_Edge_Graph[T]): WeightedDirectedGraph[T]

proc initWeightedRangeGraph(N: int): Range_Edge_Graph[int] {....raises: [],
    tags: [].}

proc initWeightedRangeGraph[T](N: int; edgetype: typedesc[T]): Range_Edge_Graph[
    T]

proc initWeightedRangeGraph[T](N: int; zero: T): Range_Edge_Graph[T]

proc len[T](G: Range_Edge_Graph[T]): int

proc original_len[T](G: Range_Edge_Graph[T]): int