第四周作业——图的表示

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class GraphRepresentation {

	public static void main(String[] args) throws Exception {
		int arc[][];      //存放图中边的数组
		int v,e;          //图的定点数和边数
		int i,j;
		Scanner scanner = new Scanner(new File("tinyG.txt"));
		v = scanner.nextInt(); //顶点数
		e = scanner.nextInt(); //边数
		arc = new int[v][v];
		for(i=0; i<v; i++)          //初始化矩阵
			for(j=0; j<v; j++){
				arc[i][j] = 0;
			}
		for(i=0; i<e; i++){        //存储图的边的信息
			int v1 = scanner.nextInt();
			int v2 = scanner.nextInt();
			arc[v1][v2] = 1;
			arc[v2][v1] = 1;
		}
		FileWriter fw = new FileWriter(new File("tinyG_matrix.txt"));//把矩阵写入到文件中
		fw.write(v+"*"+e+"\n");
		for(i=0; i<v; i++){
			for(j=0; j<v; j++){
				fw.write(arc[i][j]+" ");
			}
			fw.write("\n");
		}
		fw.close();
	}
	
}

结果：