Introduction - If you have any usage issues, please Google them yourself
Data structure- the undirected graph
Stored in the form of adjacency matrix an undirected network
1. Establish and shows the adjacency matrix of undirected network
2. Breadth-first traversal of the undirected network, shows the result of traversal (and at any time according to queue into or out of)
3. Use she algorithm to construct its minimum spanning tree, according to the construction process.