问题描述
若用无向图表示高速公路网，其中顶点表示城市，边表示城市之间的高速公路。试设计一个找路程序，获取两个城市之间的所有简单路径。
基本要求
（1） 输入参数：结点总数，结点的城市编号（4位长的数字，例如电话区号，长沙是0731），连接城市的高速公路（用高速公路连接的两个城市编号标记）。
（2） 输入 要求取所有简单路径的两个城市编号。
（3） 将所有路径（有城市编号组成）输出到用户指定的文件中。
Problem descriptionIf use undirected graph said freeways, with vertex said city, edge said highway between the two cities.Try to design a route program, obtain all simple paths between the two cities. The basic requirements(1) input parameters: the total number of nodes, the nodes of the city number (4 digits long Numbers, telephone area code, for example, changsha is 0731), connected to the city expressway (with high-speed highway connects the two cities of number tags).(2) input requirements take number all simple paths of the two cities.(3) will all paths (a number of city) output to the user specified file. (2017-01-02, Dev C++, 3KB, 下载4次)