java 实现地图gps轨迹_Java实现dijkstra算法： 地图中任意起点寻找最佳路径

wl){

if(wl.size() == 0){

System.out.println("done");

return false;

}else if(wl.size() == 1){

current = wl.get(0).getDest();

length = wl.get(0).getDist();

Route.add(Route.size(), wl.get(0));

wl.remove(wl.get(0));

}else{

Node s = wl.get(0);

for(Node a:wl){

if(a.getDist()s = a;

}

}

current = s.getDest();

length = s.getDist();

Route.add(Route.size(), s);

wl.remove(s);//将waiting list中的这一点删去

}

return true;

}

public void wrap(String start, String stop){

current = start;

if(addNodes()){

for(int i=0;;i++){

if(stop == current){

//Route.add();

break;}

toWait(curren