第四周作业——图的表示

package d;

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

public class Graph{	
	
	int v;  //顶点数
	int e;  //边数
	static int [][] matrix ; //邻接矩阵
	
	public static void main(String[] args){
		try(
			Scanner scanner = new Scanner(new File("tinyG.txt"));
			PrintWriter fout = new PrintWriter(new File("tinyG_matrix.txt"));){
			int v = scanner.nextInt();  //顶点的数目
			int e = scanner.nextInt();  //边的数目
			matrix = new int[v][v];
			//读取每条边对应的两个顶点,设置邻接矩阵的值
			for (int i = 0; i < e; i++) {				
				int v1 = scanner.nextInt();
				int v2 = scanner.nextInt();
				matrix[v1][v2] = 1;
				matrix[v2][v1] = 1;
			}
			
			//无向图的邻接矩阵写到文件中
			for(int i=0; i<v; i++){
				for(int j=0; j<v; j++){
					fout.print(matrix[i][j] + "  ");
				}
				fout.println();
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
		
		System.out.println("邻接矩阵已写到“tinyG_matrix.txt”");
		
	}
	
}