有向图中反向图构造。对tinyDG.txt(http://pan.baidu.com/s/1o6jWtcA)文件所表示的图,输出其邻接表表示 与 反向图的邻接表表示。类名:GraphReverse。博文标题:第五周作业——有向图邻接表表示及反向图构造
邻接表表示示例如下:
0:1 5
1:
2:0 3
……
package exercise5;
import java.io.File;
import java.util.Scanner;
public class GraphReverse {
int arc[][]; //存放图中边的数组
int v,e; //图的定点数和边数
int[] visited;
int flag=0;
public GraphReverse(int v, int e){
this.v = v;
this.e = e;
arc = new int[v][v];
for(int i=0; i<v; i++)
for(int j=0; j<v; j++){
arc[i][j] = 0;
}
visited = new int[v];
for(int i=0; i<v; i++){
visited[i] = 0;
}
}
public void edges(int v1,int v2){ //图中边的信息
arc[v1][v2] = 1;
arc[v2][v1] = -1;
}
public int[][] getEdges(){ //获取邻接矩阵
return arc;
}
public void ALGraph(){ //原图邻接表
for(int i=0; i<v; i++){
System.out.print(i+":");
for(int j=0; j<v; j++){
if(arc[i][j]==1){
System.out.print(j+" ");
}
}
System.out.println();
}
}
public void Graph(){ //反向图邻接表
for(int i=0; i<v; i++){
System.out.print(i+":");
for(int j=0; j<v; j++){
if(arc[i][j]==-1){
System.out.print(j+" ");
}
}
System.out.println();
}
}
public static void main(String[] args) throws Exception {
int i,j;
Scanner scanner = new Scanner(new File("C://自定义/tinyDG.txt"));
int v = scanner.nextInt(); //顶点数
int e = scanner.nextInt(); //边数
GraphReverse g = new GraphReverse(v, e);
for(i=0; i<e; i++){
int v1 = scanner.nextInt();
int v2 = scanner.nextInt();
g.edges(v1, v2);
}
System.out.println("图的邻接表:");
g.ALGraph();
System.out.println("反向图的邻接表:");
g.Graph();
}
}