: Network develop
: 2018-01-08 00:23:57
Description: 1. problem description
If we use undirected graph to express expressway network, where vertices represent cities and express expressways between cities, we try to design a road finding program to get all the simple paths between two cities.
2. input data
The number of input nodes n, enter the number of the city, because it is four digit number, for the sake of simplicity and uniformity, it is set to int type. By entering the number of the two cities, there is a highway between the two cities. Finally, when looking for the road, enter the number of the two cities to indicate the starting point and the end point of the road.
3. output data
Output all possible paths composed of city numbers, type int.
easy road\ey.txt, 67 , 2017-12-26
easy road\lj.txt, 10 , 2017-12-27
easy road\简单路径 (1).exe, 2103635 , 2017-12-27
easy road\简单路径.cpp, 4656 , 2017-12-27
easy road, 0 , 2017-12-27