文件名称:fenzhi
介绍说明--下载内容均来自于网络,请自行研究使用
通过分支限界的方法,求解1到n的最短路径。设数组a保存图的邻接矩阵,0-9号,共10个节点。节点1为源点,n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target points.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
fenzhi
......\AliveNode.java
......\MinHeap.java
......\MinHeap.java.bak
......\Shortpath.java
......\AliveNode.java
......\MinHeap.java
......\MinHeap.java.bak
......\Shortpath.java