第四周作业——图的表示

import java.util.Scanner;

import suanfazuoye_1.execilse;

public class GraphRepresentation {

private static  int v1;
private static int v2;
private int [][] matrix;
//两个顶点间存在边,矩阵值 为1
public void addEdge(int v1, int v2){
matrix[v1][v2] = 1;
matrix[v2][v1] = 1;
}
public static void main(String[] args) {
// TODO 自动生成的方法存根
GraphRepresentation grt = new GraphRepresentation();
System.out.println("请输入有链接的两个点");
Scanner scan = new Scanner(System.in);
int a=1;
while(a>0){
v1 = scan.nextInt();
v2 = scan.nextInt();
grt.addEdge(v1, v2);
System.out.println("是否继续输入(0为否，1为是)：");
a = scan.nextInt();
}

}
}