第四周作业——图的表示

package week_4;

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

public class GraphRepresentation {
int v ; //vertex 顶点
int e ; //edge 边的数目
int[][] matrix;   //邻接矩阵

//构造函数，初始化函数
public GraphRepresentation(int v,int e) {
this.v = v;
this.e = e;
matrix = new int[v][e];
}

//两个顶点存在边，设置矩阵的值为1
public void addEdge(int v1,int v2) {
matrix[v1][v2] = 1;
matrix[v2][v1] = 1;
}

//获取邻接矩阵
public int[][] getAdjacentMatrix(){
return matrix;
}

//主函数
public static void main(String[] args){
String path = "d://graph/";
try{
File file = new File(path+"tinyG.txt");
Scanner scan = new Scanner(file);
PrintWriter out = new PrintWriter(path+"tinyG_Matrix.txt");

int v = scan.nextInt();  //读取第一行是顶点的个数
int e = scan.nextInt();  //读取第二行是边的个数

GraphRepresentation graph = new GraphRepresentation(v,e);

//读取每条边对应的顶点,设置邻接矩阵的值
for(int i=0;i<e;i++){
int v1 = scan.nextInt();
int v2 = scan.nextInt();
graph.addEdge(v1, v2);
}

//获取无向图的邻接矩阵，并且写入文件
int[][] matrix = graph.getAdjacentMatrix();
for(int i=0;i<v;i++){
for(int j=0;j<v;j++) {
out.print(matrix[i][j]+"\t");  //显示第一行
}
out.println();  //换行
}
out.close();

}catch(Exception e) {
e.printStackTrace();
//throw new RuntimeException(e.getMessage());

}
System.out.println("邻接矩阵已经成功写入文件…");
}

}