Lintcode: Topological Sorting

Given an directed graph, a topological order of the graph nodes is defined as follow:

For each directed edge A-->B in graph, A must before B in the order list.
The first node in the order can be any node in the graph with no nodes direct to it.
Find any topological order for the given graph.
Note
You can assume that there is at least one topological order in the graph.

Example
For graph as follow:


The topological order can be:

[0, 1, 2, 3, 4, 5]

or

[0, 2, 3, 1, 5, 4]

or

....

Challenge
Can you do it in both BFS and DFS?

这道题参考了网上一些很好的思路：

method1:  Record the pre nodes of every node, then find out a node without pre node in each iteration and delete this node from unvisited set, add this node to result.

 /**
  * 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> res = new ArrayList<DirectedGraphNode>();
         if (graph.size() == 0) return res;
         HashMap<DirectedGraphNode, Set<DirectedGraphNode>> map = new HashMap<DirectedGraphNode, Set<DirectedGraphNode>>();
         for (DirectedGraphNode each : graph) {
             map.put(each, new HashSet<DirectedGraphNode>());
         }
         for (DirectedGraphNode each : graph) {
             for (int i=0; i<each.neighbors.size(); i++) {
                 map.get(each.neighbors.get(i)).add(each);
             }
         }
         while (graph.size() > 0) {
             int index = 0;
             while (index < graph.size()) {
                 DirectedGraphNode cur = graph.get(index);
                 if (map.get(cur).size() == 0) {
                     //add the node to our result
                     //remove the node from the graph
                     res.add(cur);
                     graph.remove(index);
                     for (DirectedGraphNode elem : graph) {
                         if (map.get(elem).contains(cur)) {
                             map.get(elem).remove(cur);
                         }
                     }
                 }
                 else index++;
             }
         }
         return res;
     }
 }

method2: DFS: use a recursive method, randomly pick up an unmakred node, before adding it into result list, recursively visite all its neighbors and add its neighbors into list first. In this way, we guarantee that all the nodes belong to some node's post nodes will be added to the result list first.

To be more specific, we can modify DFSto find Topological Sorting of a graph. In DFS, we start from a vertex, we first print it and then recursively call DFS for its adjacent vertices. In topological sorting, we don’t print the vertex immediately, we first recursively call topological sorting for all its adjacent vertices, then print the current vertex. In this way, we ensure a node's neighbor nodes are always added before the node itself.

 /**
  * 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> res= new ArrayList<DirectedGraphNode>();
         if (graph.size() == 0) return res;
         HashMap<DirectedGraphNode, Integer> status = new HashMap<DirectedGraphNode, Integer>();
         for (DirectedGraphNode elem : graph) {
             status.put(elem, 0);
         }
         ArrayList<DirectedGraphNode> templist = new ArrayList<DirectedGraphNode>();
         templist.add(null);
         while (hasUnvisited(graph, status, templist)) {
             DirectedGraphNode cur = templist.get(0);
             templist.set(0, null);
             search(cur, status, res);
         }
         return res;
     }

     public boolean hasUnvisited(ArrayList<DirectedGraphNode> graph, HashMap<DirectedGraphNode, Integer> status, ArrayList<DirectedGraphNode> templist) {
         for (DirectedGraphNode elem : graph) {
             if (status.get(elem) == 0) {
                 templist.set(0, elem);
                 return true;
             }
         }
         return false;
     }

     public void search(DirectedGraphNode cur, HashMap<DirectedGraphNode, Integer> status, ArrayList<DirectedGraphNode> res) {
         if (status.get(cur) == 1) System.out.println("not a DAG");
         if (status.get(cur) == 2) return;
         status.put(cur, 1);
         for (DirectedGraphNode neigh : cur.neighbors) {
             search(neigh, status, res);
         }
         status.put(cur, 2);
         res.add(0, cur);
     }
 }