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

</pre><pre class="java" name="code">package bag;
import java.io.File;       
import java.util.Scanner;    
    
public class GraphReverse{            
    int v, e;    
    static int [][]biao ;
    static int [][] tu;  
    
    public static void main(String[] args){    
        try{  
            Scanner scanner=new Scanner(new File("E:\\tinyDG.txt"));//读取文件                                                
            int v =scanner.nextInt();   //读入顶点
            int e =scanner.nextInt();   //读入边
            biao =new int[v][v];    
            tu =new int[v][v];     
            for (int i=0; i<e;i++) {                    
                int vn=scanner.nextInt();    
                int vt=scanner.nextInt();    
                biao[vn][vt]=1;    
               tu[vt][vn] = 1;    
            }             
            System.out.println("邻接表表示：");    
            for(int i=0; i<v; i++){    
                System.out.print(i + " : ");   
                for(int j=0; j<v; j++){    
                    if(biao[i][j]>0)  
                    System.out.print(j + "  ");    
                }    
               
                System.out.println();    
            } 
                       
            System.out.println();
            System.out.println("反向图表示：");    
            for(int i=0; i<v; i++){    
                System.out.print(i + " : ");  
                for(int j=0; j<v; j++){    
                if(tu[i][j]>0)  
                    System.out.print(j + "  ");    
                }    
                System.out.println();    
            }    
        } 
        catch (Exception e) {    
            e.printStackTrace();    
        }                      
    }    
        
}