Description: (1) keyboard input data, the establishment of a directed graph adjacency list and outputs the adjacent table.
(2) using the adjacent table storage implementation has to depth-first graph traversal.
(3) try to write an algorithm to determine the adjacent table stored there if the vertex to vertex Vj Vi path (i <> j) the presence of the figure.
There are (4) has been directed graph adjacency list representation, program judging vertex u to vertex v and whether there is a simple path, if you print a vertex on the path.
(5) design a simple menu in the main function, namely debug the algorithm described above.
To Search:
File list (Check if you may need any files):
Debug
.....\vc60.idb
.....\vc60.pdb
.....\有向图.exe
.....\有向图.ilk
.....\有向图.obj
.....\有向图.pch
.....\有向图.pdb
有向图.cpp
有向图.dsp
有向图.dsw
有向图.ncb
有向图.opt
有向图.plg
Download