src/cplib/graph/kruskal

  Source   Edit

Procs

proc get_MST_cost(G: WeightedUnDirectedGraph[float32] or
    WeightedUnDirectedStaticGraph[float32]; ZERO: float32 = 0.0'f32;
                  INF: float32 = 1e+30'f32): float32
  Source   Edit
proc get_MST_cost(G: WeightedUnDirectedGraph[float] or
    WeightedUnDirectedStaticGraph[float]; ZERO: float = 0.0; INF: float = 1e+100): float
  Source   Edit
proc get_MST_cost(G: WeightedUnDirectedGraph[int32] or
    WeightedUnDirectedStaticGraph[int32]; ZERO: int32 = 0.int32;
                  INF: int32 = INF32): int32
  Source   Edit
proc get_MST_cost(G: WeightedUnDirectedGraph[int] or
    WeightedUnDirectedStaticGraph[int]; ZERO: int = 0; INF: int = INF64): int
  Source   Edit
proc get_MST_cost[T](G: WeightedUnDirectedGraph[T] or
    WeightedUnDirectedStaticGraph[T]; ZERO, INF: T): T
  Source   Edit
proc to_MST_Graph[T](G: WeightedUnDirectedGraph[T] or
    WeightedUnDirectedStaticGraph[T]): WeightedUnDirectedGraph[T]
最小全域木を取ったときのグラフを返す   Source   Edit