Title:
FindaMininalSpanningTree
Download
Description: Enter the right graph with adjacency matrix, the output of the adjacency matrix of a minimum spanning tree, this experiment used the theoretical knowledge Prim algorithm for algorithm design based map G = (V, E), its spanning the vertex set of U. ①, the v0 into U. ②, in all u ∈ U, v ∈ VU edge (u, v) ∈ E in finding a minimum weight edge, by adding spanning tree. ③, ② to find the edge to join the U of v set. If U has a collection of n elements, then the end, otherwise continue ②.
To Search:
- [prim] - prim
- [zuixiaoquandingdianfugai] - Empowering given a undirected graph G =
- [PRIMS] - prim s algo is to find mininum spanning
- [EulerCircuit] - Enter the code lab report with a graph G
- [2(2)] - Prim minimum spanning tree algorithm of
- [prim] - Math math-Prim minimum spanning tree alg
File list (Check if you may need any files):
实验一 Find a Mininal Spanning Tree.doc
