Graph::Kruskal Kruskal's Algorithm for Minimal Spanning Trees in Graphs
Download

Graph::Kruskal Ranking & Summary

Graph::Kruskal Tags

Perl module algorithm Kruskal Algorithm Minimal Spanning Trees Kruskal Spanning

Graph::Kruskal Description

Kruskal's Algorithm for Minimal Spanning Trees in Graphs Graph::Kruskal is Perl module Kruskal's Algorithm for Minimal Spanning Trees in Graphs.Computes the Minimal Spanning Tree of a given graph according to some cost function defined on the edges of the graph.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) between the vortices of the (non-directed and connected) graph (i.e., the edges can be traveled in either direction, and a path must exist between any two vortices), and the cost of each edge (for instance, the geographical distance).Output: A set of edges forming a spanning tree (i.e., a set of edges linking all vortices, so that a path exists between any two vortices) which is free of circles (because it's a tree) and which is minimal in terms of the cost function defined on the set of edges.See Aho, Hopcroft, Ullman, "The Design and Analysis of Computer Algorithms" for more details on the algorithm. Requirements: · Perl

Graph::Kruskal Related Software