Description: Unicom graph G is a subgraph of G is the one that contains all the vertices of the tree, the subgraph Spanning Tree called G Unicom Figure minimal connected subgraph. The so-called minimal means: any tree, add an edge, then a loop an edge if removed, will make the programming of non-connected graph. The sum of the weights of each edge of the spanning tree is called the right of erythropoietin. The right to the minimum spanning tree called the minimum spanning tree, commonly used algorithms prime algorithm and kruskal-algorithms.
To Search:
File list (Check if you may need any files):
PHEAP.H
Download