Graph::Kruskal - Kruskal's Algorithm for Minimal Spanning Trees in Graphs River stage zero No dependents

This algorithm computes the Minimal Spanning Tree of a given graph according to some cost function defined on the edges of that graph. Input: A set of vortices which constitute a graph (some cities on a map, for example), a set of edges (i.e., roads)...

STBEY/Graph-Kruskal-2.0 - 07 Aug 1997 06:10:42 UTC
1 result (0.026 seconds)