Description: 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.
File list (Check if you may need any files):
fenzhi
......\AliveNode.java
......\MinHeap.java
......\MinHeap.java.bak
......\Shortpath.java
Download