Procs
proc steiner_tree_dp[T](g: StaticGraph[T] or DynamicGraph[T]; terminal: seq[int]; inf: T): seq[seq[T]]
- terminal に含まれる頂点を全て連結にするために必要な最小のコストを出力する。 計算量 O(n3^t + (n+m)2^tlogn) Source Edit
proc steiner_tree_mincost(g: StaticGraph[float] or DynamicGraph[float]; terminal: seq[int]; inf: float = 1e+100): float
- Source Edit
proc steiner_tree_mincost(g: StaticGraph[int32] or DynamicGraph[int32]; terminal: seq[int]; inf: int32 = INF32): int32
- Source Edit
proc steiner_tree_mincost(g: StaticGraph[int] or DynamicGraph[int]; terminal: seq[int]; inf: int = INF64): int
- Source Edit
proc steiner_tree_mincost[T](g: StaticGraph[T] or DynamicGraph[T]; terminal: seq[int]; inf: T): T
- Source Edit