Class: Kruskal
| Recommend this page to a friend! |  Stumble It! |
 Bookmark in del.icio.us |
| Classes of nikita m. kozlvovsky | > | Kruskal | > | Download .tar.gz .zip | > |  Support forum (2) |
> |  Blog |
> |   Latest changes |
||
|
| ||||||||||||||||||||||||||||||||||||||||||||
| Detailed description | ||
| 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. |
| Groups | ||
 |
Algorithms | Numerical and statistical algorithms | View top rated classes |
 User ratings |
Applications |  Files |
||||
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.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
For more information send a message to :
info at phpclasses dot org.
info at phpclasses dot org.
| Copyright (c) Icontem 1999-2012 | PHP Classes | - PHP Class Scripts |
| PHP Book Reviews | - Reviews of books and other products |