package Text5;
import java.io.*;
import java.util.*;
public class GraphReverse {
private int vNum;
private int aNum;
private boolean visited[];
private List<ArrayList<Integer>> graphListS;
private List<ArrayList<Integer>> graphListF;
public GraphReverse(int vNum,int arcNum,List<ArrayList<Integer>> graphListS,List<ArrayList<Integer>> graphListF){
this.vNum=vNum;
this.graphListS=graphListS;
visited=new boolean[vNum];
this.graphListF=graphListF;
}
private void bfs(int v,List<ArrayList<Integer>> graphList){
Queue<Integer> que = new LinkedList<Integer>();
que.offer(v);
while (!que.isEmpty()) {
v = que.poll();
System.out.print(v+":");
visited[v] = true;
for (int i = 0; i <graphList.get(v).size(); i++) {
int k=graphList.get(v).get(i);
System.out.print(k+" ");
if (!visited[k]){
que.add(k);
que.offer(k);
visited[k] = true;
}
}
System.out.println();
}
}
public static void main(String[] args) {
String path="d:/tinyDG.txt";
try{
Scanner scanner=new Scanner(new File(path));
List<ArrayList<Integer>> graphListS=new ArrayList<ArrayList<Integer>>();//存储有向图的邻接表
List<ArrayList<Integer>> graphListF=new ArrayList<ArrayList<Integer>>();//存储有向图的反向图的邻接表
int vertexNum=scanner.nextInt();
int aNum=scanner.nextInt();
for(int i=0;i<vertexNum;i++){
graphListS.add(new ArrayList<Integer>());
graphListF.add(new ArrayList<Integer>());
}
//有向图的存储
for(int i=0;i<aNum;i++){
int u=scanner.nextInt();
int v=scanner.nextInt();
if(!graphListS.get(u).contains(v)){
graphListS.get(u).add(v);
}
//有向图的反向图存储
if(!graphListF.get(v).contains(u)){
graphListF.get(v).add(u);
}
}
//进行有向图广度优先遍历
GraphReverse g1=new GraphReverse(vertexNum, aNum, graphListS,null);
System.out.println("************************************");
System.out.println("有向图的邻接表:");
g1.bfs(vertexNum/2+1,graphListS);
System.out.println(" ");
//进行反向图广度优先遍历
GraphReverse g2=new GraphReverse(vertexNum, aNum, null,graphListF);
System.out.println("************************************");
System.out.println("有向图的反向图的邻接表:");
g2.bfs(1,graphListF);
}catch (Exception e) {
e.printStackTrace();
}
}
}