java 点到点最短路径_最短路径算法（旅游规划实例java语言）

public class RailSystem {//模拟铁路系统

SeqList citylist;

HashMappath;           HashMapdistance;

String  from_city;

City currentcity;

public RailSystem() {

citylist= new SeqList(20);

}

public void addCity(String name) {

citylist.add(new City(name));

}

public City getCity(String name) {

for(int i=0;i

if(citylist.get(i).getName().equals(name)) {

return citylist.get(i);

}

}return null;

}

public void calc_route(String first){//计算各结点最小价格

from_city=null;

Set cityin=new HashSet<>();//未遍历的结点

Set cityout=new HashSet<>();//已遍历的结点

path=new HashMap<>();//各结点的先驱结点

distance=new HashMap<>();//起始点到此结点的距离

Service edge;

for(int i=0;i

cityin.add(citylist.get(