This project must be written in C++, if it is not scored. Project fetch

After extending the plain text name of "xt", open it and read

The content of the case, the content of the case records the adjacencli of a certain picture

array, if the Sequential Representation element is empty

White "separated and end with Enter), and then output the depth first of the graph separately

(DFS) and Degree Priority (BFS) visit results,