最短路径算法

求最短路径:V5□^皿代码实现：publicclassDataTest{publicstaticintINFINITY=90000;publicstaticMap<String,Vertex>vertexMap=newHashMap<String,Vertex>();staticclassEdge{publicVertexdest;publicdoublecost;publicEdge(Vertexd,doublec){this.dest=d;this.cost=c;}}staticclassVerteximplementsComparable<Vertex>{publicStringname;publicList<Edge>adj;publicdoubledist;publicVertexprev;publicintscratch;publicbooleanvisited;publicVertex(Stringnm){=nm;adj=newArrayList<Edge>();reset();}publicvoidreset(){visited=false;dist=DataTest.INFINITY;}publicintcompareTo(Vertexo){doublec=o.dist;returndist<c?-1:dist>c?1:0;}}publicstaticvoiddijkstra(StringstartName){PriorityQueue<Vertex>pq=newPriorityQueue<Vertex>();//该队列以权值升序排列，因为Vertex实现Comparable接口Vertexstart=vertexMap.get(startName);startdist=0;for(Vertexv:vertexMap.values())pq.add(v);intseenNum=0;while(!pq.isEmpty()&&seenNum<vertexMap.size()){Vertexv=pq.remove();System.out.println("v0>"++":.”+v.dist);if(v.scratch!=0)continue;scratch=1;seenNum++;for(Edgee:v.adj){Vertexw=dest;doublev_to_w=e.cost;if(w.dist>v.dist+v_to_w){dist=v.dist+v_to_w;prev=v;pq.remove(//出队pq.add(//按优先级插在队头，先插入的在队头，依次往后}}}while(pq.peek()!=null){Systeout.println(pq.poll());publicstaticvoidVertexv0=newVertexv1=newVertexv2=newVertexv3=newVertexv4=newVertexv5=newmain(String[]args){Vertex("v0");Vertex("v1");Vertex("v2");Vertex("v3");Vertex("v4");Vertex("v5");List<Edge>e0l=v0adj;List<Edge>e1l=v1adj;List<Edge>e2l=v2adj;List<Edge>e3l=v3adj;List<Edge>e4l=v4adj;List<Edge>e5l=v5adj;Edgee01=newEdgee02=newe0l.add(e01);e0l.add(e02);Edge(v1,5);Edge(v2,3);Edgee13=newEdgee14=newe1l.add(e13);e1l.add(e14);Edge(v3,3);Edge(v4,3);Edgee21=newEdgee23=newEdgee24=newe2l.add(e21);e2l.add(e23);e2l.add(e24);Edge(v1,1);Edge(v3,4);Edge(v4,2);Edgee35=newe3l.add(e35);Edge(v5,5);Edgee43=newEdgee45=newe4l.add(e43);e4l.add(e45);/*Edge(v3,1);Edge(v5,2);以上代码构建有向图v0>v1:5v0>V2:3v1>V3:3V1>V4:3V2————>V1:1V2————>V4:2V2————>V3:4V3->V5:5v4>V3:1v4>V5:2夫/vertexMap.put("v0",v0);vertexMap.put("v1",v1);vertexMap.put("v2",v2);vertexMap.put("v3",v3);vertexMap.put("v4",