Title:
Graph-traversal-spanning-tree
Download
Description: Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree minimum spanning tree PRIM algorithm, KRUSCAL algorithm, graph the connected components.
2. When the user chooses function mistake, the system will be output corresponding hints.
3. Through the realization of the operation, the graph of some actual life in the specific things abstract out
To Search:
File list (Check if you may need any files):
图的深度优先遍历生成树.cpp
