# connected graph

• Prim algorithm and Kruskal Algorithm

Prim algorithm and Kruskal algorithms can find the minimum spanning tree from a connected graph. Difference is that the Prim algorithm is to find one by one, and Kruskal is to sort the find. A, Prim algorithm: Prim algorithm is to find a right of re-

• Minimum Spanning Tree - Prim and Kruskal (greedy)

Between n cities in the laying of fiber optic cable, the high cost of laying fiber optic cable and fiber optic cable in various cities the cost of laying different. If the design goal is to make it n between any two cities, the city can be direct or

• Classical algorithm for minimum spanning tree Kruscal

Of the article: ktyanny Source: ktyanny reproduced please specify, thank you. Fled yesterday saying ktyanny day course, catching up and check set of knowledge, is to write a very, very classic of Kruscal minimum spanning tree. Get up at 9 o'clock thi

• GOOGLE's a document questions - seeking to be connected acyclic undirected graph can generate a minimum height of the tree

/ * Google has recently seen a document questions, "known a non-acyclic connected graph T of all vertices and edges of the information, Is the need to convert it to a tree, the tree and the depth required, please design an algorithm to find all the t

• POJ 1639 Picnic Planning minimum spanning tree

/ * This title tune faster vomiting blood, and done really hard This problem is mainly seeking minimum spanning tree, that is, given a tree, a node in the node with the maximum degree, then seek to meet such a condition the right of the tree and the

1
2
3
4
5
6
7
8
9
10