From 1c5e1d92153393e8ee32fe9a9d7446edc0bed250 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=B7=A6=E7=A8=8B=E4=BA=91?= <algorithmzuo@163.com>
Date: Fri, 20 Nov 2020 11:09:52 +0800
Subject: [PATCH] modify code

---
 src/class10/Code03_TopologicalOrderBFS.java | 53 ++++++++++++++++
 src/class10/Code03_TopologicalOrderDFS.java | 70 +++++++++++++++++++++
 2 files changed, 123 insertions(+)
 create mode 100644 src/class10/Code03_TopologicalOrderBFS.java
 create mode 100644 src/class10/Code03_TopologicalOrderDFS.java

diff --git a/src/class10/Code03_TopologicalOrderBFS.java b/src/class10/Code03_TopologicalOrderBFS.java
new file mode 100644
index 0000000..07f61b1
--- /dev/null
+++ b/src/class10/Code03_TopologicalOrderBFS.java
@@ -0,0 +1,53 @@
+package class10;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.Queue;
+
+// OJ链接：https://www.lintcode.com/problem/topological-sorting
+public class Code03_TopologicalOrderBFS {
+
+	// 不要提交这个类
+	public static class DirectedGraphNode {
+		public int label;
+		public ArrayList<DirectedGraphNode> neighbors;
+
+		public DirectedGraphNode(int x) {
+			label = x;
+			neighbors = new ArrayList<DirectedGraphNode>();
+		}
+	}
+
+	// 提交下面的
+	public static ArrayList<DirectedGraphNode> topSort(ArrayList<DirectedGraphNode> graph) {
+		HashMap<DirectedGraphNode, Integer> indegreeMap = new HashMap<>();
+		for (DirectedGraphNode cur : graph) {
+			indegreeMap.put(cur, 0);
+		}
+		for (DirectedGraphNode cur : graph) {
+			for (DirectedGraphNode next : cur.neighbors) {
+				indegreeMap.put(next, indegreeMap.get(next) + 1);
+			}
+		}
+		Queue<DirectedGraphNode> zeroQueue = new LinkedList<>();
+		for (DirectedGraphNode cur : indegreeMap.keySet()) {
+			if (indegreeMap.get(cur) == 0) {
+				zeroQueue.add(cur);
+			}
+		}
+		ArrayList<DirectedGraphNode> ans = new ArrayList<>();
+		while (!zeroQueue.isEmpty()) {
+			DirectedGraphNode cur = zeroQueue.poll();
+			ans.add(cur);
+			for (DirectedGraphNode next : cur.neighbors) {
+				indegreeMap.put(next, indegreeMap.get(next) - 1);
+				if (indegreeMap.get(next) == 0) {
+					zeroQueue.offer(next);
+				}
+			}
+		}
+		return ans;
+	}
+
+}
diff --git a/src/class10/Code03_TopologicalOrderDFS.java b/src/class10/Code03_TopologicalOrderDFS.java
new file mode 100644
index 0000000..d15fbe6
--- /dev/null
+++ b/src/class10/Code03_TopologicalOrderDFS.java
@@ -0,0 +1,70 @@
+package class10;
+
+import java.util.ArrayList;
+import java.util.Comparator;
+import java.util.HashMap;
+
+// OJ链接：https://www.lintcode.com/problem/topological-sorting
+public class Code03_TopologicalOrderDFS {
+
+	// 不要提交这个类
+	public static class DirectedGraphNode {
+		public int label;
+		public ArrayList<DirectedGraphNode> neighbors;
+
+		public DirectedGraphNode(int x) {
+			label = x;
+			neighbors = new ArrayList<DirectedGraphNode>();
+		}
+	}
+
+	// 提交下面的
+	public static class Record {
+		public DirectedGraphNode node;
+		public int deep;
+
+		public Record(DirectedGraphNode n, int o) {
+			node = n;
+			deep = o;
+		}
+	}
+
+	public static class MyComparator implements Comparator<Record> {
+
+		@Override
+		public int compare(Record o1, Record o2) {
+			return o2.deep - o1.deep;
+		}
+	}
+
+	public static ArrayList<DirectedGraphNode> topSort(ArrayList<DirectedGraphNode> graph) {
+		HashMap<DirectedGraphNode, Record> order = new HashMap<>();
+		for (DirectedGraphNode cur : graph) {
+			f(cur, order);
+		}
+		ArrayList<Record> recordArr = new ArrayList<>();
+		for (Record r : order.values()) {
+			recordArr.add(r);
+		}
+		recordArr.sort(new MyComparator());
+		ArrayList<DirectedGraphNode> ans = new ArrayList<DirectedGraphNode>();
+		for (Record r : recordArr) {
+			ans.add(r.node);
+		}
+		return ans;
+	}
+
+	public static Record f(DirectedGraphNode cur, HashMap<DirectedGraphNode, Record> order) {
+		if (order.containsKey(cur)) {
+			return order.get(cur);
+		}
+		int follow = 0;
+		for (DirectedGraphNode next : cur.neighbors) {
+			follow = Math.max(follow, f(next, order).deep);
+		}
+		Record ans = new Record(cur, follow + 1);
+		order.put(cur, ans);
+		return ans;
+	}
+
+}