public class Vertex {
//存放點(diǎn)信息
public int data;
//與該點(diǎn)鄰接的第一個邊節(jié)點(diǎn)
public Edge firstEdge;
}

//邊節(jié)點(diǎn)
public class Edge {
//對應(yīng)的點(diǎn)下表
public int vertexId;
//邊的權(quán)重
public int weight;
//下一個邊節(jié)點(diǎn)
public Edge next;
//getter and setter自行補(bǔ)充
}

import java.util.HashMap;
import java.util.Map;
import java.util.Stack;
public class graph {
public Vertex[] vertexList; //存放點(diǎn)的集合
public graph(int vertexNum){
 this.vertexNum=vertexNum;
 vertexList=new Vertex[vertexNum];
}
//點(diǎn)個數(shù)
public int vertexNum;
//邊個數(shù)
public int edgeLength;
public void initVertext(int datas[]){
 for(int i=0;i<vertexNum;i++){
 Vertex vertext=new Vertex();
 vertext.data=datas[i];
 vertext.firstEdge=null;
 vertexList[i]=vertext;
 //System.out.println("i"+vertexList[i]);
 }
 isVisited=new boolean[vertexNum];
 for(int i=0;i<isVisited.length;i++){
 isVisited[i]=false;
 }
}
//針對x節(jié)點(diǎn)添加邊節(jié)點(diǎn)y
public void addEdge(int x,int y,int weight){
 Edge edge=new Edge();
 edge.setVertexId(y);
 edge.setWeight(weight);
 //第一個邊節(jié)點(diǎn)
 System.out.println(vertexList.length);
 if(null==vertexList[x].firstEdge){
 vertexList[x].firstEdge=edge;
 edge.setNext(null);
 }
 //不是第一個邊節(jié)點(diǎn),則采用頭插法
 else{
 edge.next=vertexList[x].firstEdge;
 vertexList[x].firstEdge=edge;
 }
}
//得到x的鄰接點(diǎn)為y的后一個鄰接點(diǎn)位置,為-1說明沒有找到
public int getNextNode(int x,int y){
 int next_node=-1;
 Edge edge=vertexList[x].firstEdge;
 if(null!=edge&&y==-1){
 int n=edge.vertexId;
 //元素還不在stack中
 if(!states.get(n))
  return n;
 return -1;
 }
 
 while(null!=edge){
 //節(jié)點(diǎn)未訪問
 if(edge.vertexId==y){
  if(null!=edge.next){
   next_node=edge.next.vertexId;
  if(!states.get(next_node))
  return next_node;
  }
  else
  return -1;
 }
 edge=edge.next;
 }
 return -1;
}
//代表某節(jié)點(diǎn)是否在stack中,避免產(chǎn)生回路
public Map<Integer,Boolean> states=new HashMap();
 
//存放放入stack中的節(jié)點(diǎn)
public Stack<Integer> stack=new Stack();
 
//輸出2個節(jié)點(diǎn)之間的輸出路徑
public void visit(int x,int y){
    //初始化所有節(jié)點(diǎn)在stack中的情況
    for(int i=0;i<vertexNum;i++){
 states.put(i,false);
 }
    //stack top元素
    int top_node;
 //存放當(dāng)前top元素已經(jīng)訪問過的鄰接點(diǎn),若不存在則置-1,此時代表訪問該top元素的第一個鄰接點(diǎn)
    int adjvex_node=-1;
 int next_node;
 stack.add(x);
 states.put(x,true);
 while(!stack.isEmpty()){
 top_node=stack.peek();
 //找到需要訪問的節(jié)點(diǎn)
        if(top_node==y){
  //打印該路徑
  printPath();
  adjvex_node=stack.pop();
  states.put(adjvex_node,false);
 }
 else{
  //訪問top_node的第advex_node個鄰接點(diǎn)
            next_node=getNextNode(top_node,adjvex_node);
  if(next_node!=-1){
  stack.push(next_node);
  //置當(dāng)前節(jié)點(diǎn)訪問狀態(tài)為已在stack中
                states.put(next_node,true);
  //臨接點(diǎn)重置
                adjvex_node=-1;
  }
            //不存在臨接點(diǎn)，將stack top元素退出 
            else{
  //當(dāng)前已經(jīng)訪問過了top_node的第adjvex_node鄰接點(diǎn)
                adjvex_node=stack.pop();
  //不在stack中
  states.put(adjvex_node,false);
  }
 }
 }
}
 
//打印stack中信息,即路徑信息
 public void printPath(){
 StringBuilder sb=new StringBuilder();
 for(Integer i :stack){
 sb.append(i+"->");
 }
 sb.delete(sb.length()-2,sb.length());
 System.out.println(sb.toString());
}
 
public static void main(String[]args){
 graph g=new graph(5);
 g.initVertext(new int[]{1,2,3,4,4});
 //System.out.println(g.vertexList[0]);
 g.addEdge(0,1,1);
 g.addEdge(0,2,3);
 g.addEdge(0,3,4);
 g.addEdge(1,2,1);
 g.addEdge(2,0,1);
 g.addEdge(2,3,1);
 g.addEdge(1,3,2);
 g.visit(0,3);
}
}