CPLIB_GRAPH_STEINER_TREE = 1

proc steiner_tree_dp[T](g: StaticGraph[T] or DynamicGraph[T];
                        terminal: seq[int]; inf: T): seq[seq[T]]

proc steiner_tree_dp[T](g: StaticGraph[T] or DynamicGraph[T];
                        terminal: seq[int]; zero, inf: T): seq[seq[T]]

proc steiner_tree_mincost(g: StaticGraph[float32] or DynamicGraph[float32];
                          terminal: openArray[int]; inf: float32 = 1e+30'f32): float32

proc steiner_tree_mincost(g: StaticGraph[float32] or DynamicGraph[float32];
                          terminal: openArray[int]; zero, inf: float32): float32

proc steiner_tree_mincost(g: StaticGraph[float] or DynamicGraph[float];
                          terminal: openArray[int]; inf: float = 1e+100): float

proc steiner_tree_mincost(g: StaticGraph[float] or DynamicGraph[float];
                          terminal: openArray[int]; zero, inf: float): float

proc steiner_tree_mincost(g: StaticGraph[int32] or DynamicGraph[int32];
                          terminal: openArray[int]; inf: int32 = INF32): int32

proc steiner_tree_mincost(g: StaticGraph[int32] or DynamicGraph[int32];
                          terminal: openArray[int]; zero, inf: int32): int32

proc steiner_tree_mincost(g: StaticGraph[int] or DynamicGraph[int];
                          terminal: openArray[int]; inf: int = INF64): int

proc steiner_tree_mincost(g: StaticGraph[int] or DynamicGraph[int];
                          terminal: openArray[int]; zero, inf: int): int

proc steiner_tree_mincost[T](g: StaticGraph[T] or DynamicGraph[T];
                             terminal: openArray[int]; zero, inf: T): T