Notice
Recent Posts
Recent Comments
Link
«   2024/05   »
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31
Tags
more
Archives
Today
Total
관리 메뉴

코드와이

위상 정렬 본문

algorithm

위상 정렬

코드와이 2021. 4. 5. 22:49
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.StringTokenizer;

public class 위상정렬 {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		StringBuilder sb = new StringBuilder();
		
		int n = Integer.parseInt(st.nextToken());
		int m = Integer.parseInt(st.nextToken());
		
		List<List<Integer>> list = new ArrayList<List<Integer>>();
		int[] arr = new int[n+1];
		
		for(int i = 0 ; i <= n ; i++) {
			list.add(new ArrayList<Integer>());
		}
		
		for(int i = 0 ; i < m ; i++) {
			st = new StringTokenizer(br.readLine());
			int front = Integer.parseInt(st.nextToken());
			int back = Integer.parseInt(st.nextToken());
			
			list.get(front).add(back);
			arr[back]++;
		}
		
		Queue<Integer> queue = new LinkedList<>();
		for(int i = 1 ; i <= n ; i++) {
			if(arr[i] == 0) queue.add(i);
		}

		while(!queue.isEmpty()) {
			int q = queue.poll();

			sb.append(q).append(" ");
			
			for(int x : list.get(q)) {
				if(--arr[x] == 0) {
					queue.add(x);
				}
			}
		}
		
		sb.setLength(sb.length()-1);
		System.out.println(sb);
	}	
}

'algorithm' 카테고리의 다른 글

Algorithm  (0) 2021.11.29
Prim  (0) 2021.03.19
kruskal  (0) 2021.03.19
인접행렬[ArrayList]  (0) 2021.03.19
에라토스테네스의 체  (0) 2021.03.01