文档介绍：;;lassshutPath{staticint[][]cost;staticArrayList<String>visited=newArrayList<String>();staticArrayList<String>unVisited=newArrayList<String>();staticArrayList<String>vertexs=newArrayList<String>();staticLinkedHashMap<String,Integer>shortPath=newLinkedHashMap<String,Integer>();staticArrayList<arc>arcs=newArrayList<arc>();staticLinkedHashMap<String,String>shortPathWay=newLinkedHashMap<String,String>();publicstaticvoidmain(String[]args){//TODOAuto-generatedmethodstub//(newarc("A","B",2));(newarc("A","C",4));(newarc("A","D",15));(newarc("B","D",5));(newarc("B","C",1));(newarc("C","D",7));(newarc("D","E",4));//("A");("B");("C");("D");("E");//("A");//("B");("C");("D");("E");//inittheshortPathmapfor(StringunvisitNode:unVisited){ess=false;for(arca:arcs){if(("A")&&(unvisitNode)){(unvisitNode,);access=true;break;}}if(access==false){(unvisitNode,-1);}}//把第一个临近节点的前驱找到initFirstShortPathWay();while(()>0){StringlastVisitedNode=getLastVisitedNode();for(StringunvisitNode:unVisited){//获得最后一访问节点到未访问节点到距离intnewPath=getWeight(la