有向圖中反向圖構造。對tinyDG.txt(http://pan.baidu.com/s/1o6jWtcA)文件所表示的圖,輸出其鄰接表表示 與 反向圖的鄰接表表示。類名:GraphReverse。博文標題:第五週作業——有向圖鄰接表表示及反向圖構造
鄰接表表示示例如下:
0:1 5
1:
2:0 3
……
package sort;
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("D:/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();
}
}
結果如下: