Description:
Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-first traversal (BFS), add a vertex to the graph, deleting a vertex (also delete all of its adjacent edges), increase an arc to the map, from the figure delete an arc
To Search:
File list (Check if you may need any files):
g.dat
实验06-图（文件输入图） .cpp
Download