文件名称:060624
介绍说明－－下载内容均来自于网络，请自行研究使用
图遍历的演示
设图的结点不超过30个，每个结点用一个编号表示（如果一个图有n个结点，则它们的编号分别为1,2,…,n）。通过输入图的全部边输入一个图，每个边为一个数对，可以对边的输入顺序作出某种限制-traverse the map-based presentation of the plan node is not more than 30, each node with a No. said (if a plan with n nodes, they were the No. 1, 2, ..., n). Through all the input side of the plan to import a map, each side for a few right, on the border can order the importation of certain restrictions
设图的结点不超过30个，每个结点用一个编号表示（如果一个图有n个结点，则它们的编号分别为1,2,…,n）。通过输入图的全部边输入一个图，每个边为一个数对，可以对边的输入顺序作出某种限制-traverse the map-based presentation of the plan node is not more than 30, each node with a No. said (if a plan with n nodes, they were the No. 1, 2, ..., n). Through all the input side of the plan to import a map, each side for a few right, on the border can order the importation of certain restrictions
(系统自动生成,下载前可以参看下载内容)
下载文件列表
060624.doc