第一周作业----图的表示

package third;
import java.util.*;
import java.io.*;
public class GraphRepresentation {
static int MaxSize=13;
int vertexNum,arcNum;
int arc[][]=new int[MaxSize][MaxSize];
public static void main(String[] args){
GraphRepresentation graph=new GraphRepresentation();
graph.mGraph(13, 13);
graph.fileGraph();
// graph.vGraphOut(13);
// graph.mGraphOut(13);
}
public void mGraph(int n,int e){
vertexNum=n;arcNum=e;
for(int i=0;i<vertexNum;i++){
for(int j=0;j<vertexNum;j++){
arc[i][j]=0; 
}
}
for(int k=0;k<arcNum;k++){
int i,j;
System.out.println("输入边依附的两个顶点：");
Scanner s=new Scanner(System.in);
i=s.nextInt();
j=s.nextInt();
arc[i][j]=1;
arc[j][i]=1;
}
}
public void mGraphOut(int m){
for(int i=0;i<m;i++){
for(int j=0;j<m;j++){
System.out.print(arc[i][j]+" ");
}
System.out.println();
}
}
public void vGraphOut(int m){
for(int i=0;i<m;i++){
System.out.print(i+" ");
}
System.out.println();
}
public void fileGraph(){
try{
FileWriter fw=new FileWriter("D:/JAVAexperice/applet/myFile.txt");
BufferedWriter bf=new BufferedWriter(fw);
for(int j=0;j<arc.length;j++){
String k=String.valueOf(j);
bf.write(k+" ");
}
bf.write("\n");
for(int k=0;k<arc.length;k++){
for(int i=0;i<arc.length;i++){
String j=String.valueOf(arc[k][i]);
bf.write(j+" ");
}
bf.write("\n");
}
bf.close();
System.out.println("对了");
}catch(FileNotFoundException e){
System.out.println("错误：不能打开此文本");
}catch(IOException e){
System.out.println("错误：不能读此文本");
}
}

}