描述
给定一个包含�n个点�m条边的有向无环图,求出该图的拓扑序。若图的拓扑序不唯一,输出任意合法的拓扑序即可。若该图不能拓扑排序,输出−1−1。
输入描述:
第一行输入两个整数�,�n,m ( 1≤�,�≤2⋅1051≤n,m≤2⋅105),表示点的个数和边的条数。
接下来的�m行,每行输入两个整数��,��ui,vi (1≤�,�≤�1≤u,v≤n),表示��ui到��vi之间有一条有向边。
输出描述:
若图存在拓扑序,输出一行�n个整数,表示拓扑序。否则输出−1−1。
示例1
输入:
5 4 1 2 2 3 3 4 4 5
复制输出:
1 2 3 4 5
import java.util.*;
import java.io.*;
public class Main{
static List<Integer> ans=new ArrayList<>();
public static void main(String[] args) throws IOException {
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
BufferedWriter writer=new BufferedWriter(new OutputStreamWriter(System.out));
String[] line = reader.readLine().split(" ");
List<List<Integer>> graph=new ArrayList<>();
int n=Integer.parseInt(line[0]);
int m=Integer.parseInt(line[1]);
int[] inDegree = new int[n];
for (int i = 0; i < n; i++) {
graph.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
line = reader.readLine().split(" ");
int u=Integer.parseInt(line[0]);
int v=Integer.parseInt(line[1]);
inDegree[v-1]++;
graph.get(u-1).add(v-1);
}
boolean flag=topologicalSort(graph,inDegree);
if(flag){
for (int i = 0; i < ans.size(); i++) {
writer.write(String.valueOf(ans.get(i)));
if(i!=n-1)
{
writer.write(" ");
}
}
}
else writer.write("-1");
writer.flush();
writer.close();
}
public static boolean topologicalSort(List<List<Integer>> graph,int[] inDegree){
int num=0;
Deque <Integer> deque=new ArrayDeque<>();
for (int i = 0; i < inDegree.length; i++) {
if(inDegree[i]==0) deque.offer(i);
}
while(!deque.isEmpty())
{
int u=deque.poll();
ans.add(u+1);
for (int i = 0; i < graph.get(u).size(); i++) {
int v=graph.get(u).get(i);
inDegree[v]--;
if(inDegree[v]==0) deque.offer(v);
}
graph.get(u).clear();
num++;
}
return num==inDegree.length;
}
}