You are required to implement the branch and bound search strategy for finding the
shortest path in an undirected graph. The implementation should handle general graphs.
The graph information will be available in the same format as in the tutorials. The
program should prompt the user for the start and end node and return the shortest path
between the two nodes as well as a list of the alternative solutions and partial paths.
题目在此
那个文本文件的格式是
1 2 3
这个就是说从节点1去2的cost是3主要是不知道大概的策略..高手们点播下吧..
shortest path in an undirected graph. The implementation should handle general graphs.
The graph information will be available in the same format as in the tutorials. The
program should prompt the user for the start and end node and return the shortest path
between the two nodes as well as a list of the alternative solutions and partial paths.
题目在此
那个文本文件的格式是
1 2 3
这个就是说从节点1去2的cost是3主要是不知道大概的策略..高手们点播下吧..
回溯实际上就是树的遍历,每个叶子节点都是一个解。题目最后两个单词没看懂,“partial paths”?部分路径?那是什么?