第四周作业——图的表示

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;



public class GraphRepresentation{	
	
	int v;
	 static int[][]matrix;
	public  void create(int v){
		this.v=v;
		matrix=new int[v][v];
	}
	
	public  void HasEdge(int v,int vv){
		matrix[v][vv]=1;
		matrix[vv][v]=1;	
	}
	
	public static void main(String[] args)
	{
		Scanner scanner = null;	
		PrintWriter out = null ;
		try {
		    scanner = new Scanner(new File("tinyG.txt"));
			File outputfile=new File("d:/tinyG_matrix.txt");
			out = new PrintWriter(outputfile);
		} catch (FileNotFoundException e1) {
			
			e1.printStackTrace();
		}
		int v = scanner.nextInt();  //第一行的数字是顶点的数目  
		int e = scanner.nextInt();  //第二行的数字是边的数目  
		GraphRepresentation graph=new GraphRepresentation();
		graph.create(v);
        //读取每条边对应的两个顶点,设置邻接矩阵的值  
        for (int i = 0; i < e; i++) {                  
            int start = scanner.nextInt();  
            int end = scanner.nextInt();  
            graph.HasEdge(start,end);
	}
        for(int i=0; i<v; i++) 
        { for(int j=0; j<v; j++)
            {  System.out.print(matrix[i][j] + "  ");
          
            	 out.print("aa");  
			
			}  
        System.out.println();
        }

}
}