/**
* Definition for Directed graph.
* class DirectedGraphNode {
* int label;
* ArrayList<DirectedGraphNode> neighbors;
* DirectedGraphNode(int x) { label = x; neighbors = new ArrayList<DirectedGraphNode>(); }
* };
*/
public class Solution {
/**
* @param graph: A list of Directed graph node
* @return: Any topological order for the given graph.
*/
public ArrayList<DirectedGraphNode> topSort(ArrayList<DirectedGraphNode> graph) {
// write your code here
ArrayList<DirectedGraphNode> result = new ArrayList<>();
// 关键:value是每个点被指的次数
HashMap<DirectedGraphNode, Integer> map = new HashMap<>();
// 遍历每一个点的所有临点, 初始化map
for (DirectedGraphNode node : graph) {
for (DirectedGraphNode neighbor : node.neighbors) {
if (map.containsKey(neighbor)) {
map.put(neighbor, map.get(neighbor) + 1); // 修改value
} else {
map.put(neighbor, 1);
}
}
}
Queue<DirectedGraphNode> queue = new ArrayDeque<>();
// 进队列的点都是已经排好序的
// 先进result再进队列
// 找到第一个点
for (DirectedGraphNode node : graph) {
if (!map.containsKey(node)) {
result.add(node);
queue.offer(node);
}
}
while (!queue.isEmpty()) {
DirectedGraphNode node = queue.poll();
for (DirectedGraphNode neighbor : node.neighbors) {
map.put(neighbor, map.get(neighbor) - 1);
if (map.get(neighbor) == 0) {
result.add(neighbor);
queue.offer(neighbor);
}
}
}
return result;
}
}
[刷题]Topological Sorting
最新推荐文章于 2022-07-02 00:26:01 发布