合肥工业大学数据结构试验六图结构试验

包括完整的实验要求、实验预习报告、实验最终报告

实验要求：

<1>求给定图中的边（或弧）的数目。

<2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。

<3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根）

<4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -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.