Description: Hefei University of testing six graph data structure, including a complete experimental test requirements, test prep report, final report experimental test requirements: " 1> find edges in a given graph (or arc) number. < 2> solved from a given vertex to all vertices of the shortest path (in order to calculate the number of edges). < 3> to determine whether a directed graph g is a directed tree. (Any vertex may be the root) < 4> on a given graph G and the starting point v0, design algorithm starting from the depth of traversal graph V0 G, and construct the corresponding spanning tree.
To Search:
File list (Check if you may need any files):
数据结构试验六\AdjList.cpp
..............\AdjList.exe
..............\BFS.GRP
..............\DIRGRAPH.GRP
..............\DIRTREE.GRP
..............\DIRTREE2.GRP
..............\FLOYD.GRP
..............\GRAPH.GRP
..............\GRAPH2.GRP
..............\GRAPH5.GRP
..............\GRP.GRP
..............\GRP12.GRP
..............\GRP2.GRP
..............\GRPP1.GRP
..............\GRPPRIM.GRP
..............\实验六.pdf
..............\数据结构实验六最终报告.doc
..............\数据结构实验六预习报告.doc
数据结构试验六
Download