Description: This procedure achieved a " data structure" textbooks undirected graph the basic algorithm, including graphs, graph depth, breadth-first traversal algorithm, Prim, Kruskal minimum spanning tree construction algorithm and were used Dijkstra, Floyd algorithm to solve the source to all vertices of the graph the shortest path between any two points, and gives a specific path
To Search:
- [graph_] - //Directed graph: directed graph, undire
- [Graph] - Map-building (including the adjacency ma
File list (Check if you may need any files):
数据结构--图--无向图\无向图\UnDirectGraph.cpp
....................\......\UnDirectGraph.h
....................\......\Undirectmain.cpp
....................\......\输入示例.jpg
....................\无向图
数据结构--图--无向图
Download