第五周作业——有向图邻接表表示及反向图构造

 import java.io.*;    
import java.util.*;  
public class GraphReverse {  
   private int vnum;  
   private int anum;  
   private boolean visited[];  
   private List<ArrayList<Integer>> graphListS;  
   private List<ArrayList<Integer>> graphListF;  
   public GraphReverse(int vnum,int anum,List<ArrayList<Integer>> graphListS,List<ArrayList<Integer>> graphListF){  
       this.vnum=vnum;
       this.anum=anum;
       this.graphListS=graphListS;    
       this.graphListF=graphListF; 
       visited=new boolean[vnum];
   }  
   public static void main(String[] args) {  
    String path="F:/tinyDG.txt";  
    try{  
        Scanner in=new Scanner(new File(path));  
        List<ArrayList<Integer>> graphListS=new ArrayList<ArrayList<Integer>>();//存储有向图的邻接表   
        List<ArrayList<Integer>> graphListF=new ArrayList<ArrayList<Integer>>();//存储有向图的反向图的邻接表   
        int vnum=in.nextInt();  
        int anum=in.nextInt();  
         for(int i=0;i<vnum;i++){  
             graphListS.add(new ArrayList<Integer>());  
             graphListF.add(new ArrayList<Integer>());  
         }  
         
        for(int i=0;i<anum;i++){    
            int u=in.nextInt();  
            int v=in.nextInt();  
            if(!graphListS.get(u).contains(v)){//有向图的存储   
                graphListS.get(u).add(v);  
            }  
               
            if(!graphListF.get(v).contains(u)){//反向图存储   
                graphListF.get(v).add(u);  
            }     
        }  
          
        GraphReverse graph1=new GraphReverse(vnum, anum, graphListS,null);//广度优先遍历   
        System.out.println("有向图的邻接表的结果是：");  
        graph1.ff(vnum/2+1,graphListS);  
           
        GraphReverse graph2=new GraphReverse(vnum, anum, null,graphListF);//反向图广度优先遍历  
        System.out.println("有向图的反向图的邻接表结果是:");  
        graph2.ff(1,graphListF);         
    }catch (Exception e) {  
         e.printStackTrace();  
    }  
  }  
   private  void ff(int v,List<ArrayList<Integer>> graphList){  
         Queue<Integer> que = new LinkedList<Integer>();     
         que.offer(v);  
        while (!que.isEmpty()) {     
          v = que.poll();    
          System.out.print(v+":");     
          visited[v] = true;     
          for (int i = 0; i <graphList.get(v).size(); i++) {    
           int k=graphList.get(v).get(i);   
           System.out.print(k+" ");  
           if (!visited[k]){      
              que.offer(k);  
              visited[k] = true;     
           }     
         }   
          System.out.println();  
       }     
   }  
}