Description: Data structure- that the basic structure of the given graph edge (or arc) number. Solving out from a given vertex to all vertices of the shortest path (in order to calculate the number of edges). Determine whether a directed graph g is a directed tree. (Any one vertex may be the root) of the given graph G and the starting point, the depth of the design algorithm traverses from the starting graph G, and construct the corresponding spanning tree.
To Search:
File list (Check if you may need any files):
图的结构\f1.txt
........\f2.txt
........\f3.txt
........\f4.txt
........\file1.h
........\file2.h
........\Graph.cpp
........\graph2.cpp
........\main.cpp
图的结构
Download