Kruskal 1.0

Kruskal implements the Kruskal algorithm to find the minimum spanning tree that traverses a given set of nodes of a graph.

A graph is described as set of nodes and arcs connecting them. The class takes an associative array that has as indexes the letters of the starting and ending node.

The respective array entry values represent the cost of traversing two nodes. Kruskal returns the minimum spanning arcs and the minimum cost to traverse them.

License type: GNU General Public License
Date added: 8 years, 11 months ago | Last updated: 8 years, 11 months ago

More popular Algorithm

This is actually one of the most advanced image hosting script. The imagetize key features: SEO, Ads Ready, Admin

Listing Files

Hot Scripts