 |
|
Innovation award
Nominee: 2x |
This class 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.
The class returns the minimum spanning arcs and the minimum cost to traverse them.
November 2004
Number 4 |
Optimization techniques have always been important to solve real world situations that often turn difficult to resolve problems in situations with viable solutions.
The Kruskal algorithm provides a solution to find an optimized path that goes through multiple traversal points like the travelling salesman problem, that has also applications in the networking area.
This class provides a PHP implementation of the Kruskal algorithm that may have applications in graph drawing and solving other problems that may benefit from path finding optimization techniques.
Manuel Lemos |
| Ratings | Utility |
Consistency |
Documentation |
Examples |
Tests |
Videos |
Overall |
Rank |
| All time: |
Sufficient (70.8%) |
Sufficient (79.2%) |
- |
Sufficient (75.0%) |
- |
- |
Not sure (50.8%) |
1448 |
| Month: |
Not yet rated by the users |
| |
Applications that use this class |
|
|
No application links were specified for this class.
If you know an application of this package, send a message to the
author to add a link here.
| |
 Files |
|
|
Stumble It!
Bookmark in del.icio.us
Support forum (2)
Blog
Latest changes
Browse all classes by 
User ratings
Files
