Description: Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the relevant results. Functional requirements: the basic information input graph, and the establishment of graph storage structure (with the appropriate prompt), the output traversal sequences, then the topological sort and test the plan is to have directed acyclic graph, and the output sequence topology
To Search:
File list (Check if you may need any files):
1.cpp
Download