Lintcode:127. Topology sorting

Title source

• lintcode

Title Description

#include <vector>

using namespace std;
struct DirectedGraphNode {
    
      int label;
      vector<DirectedGraphNode *> neighbors;
      DirectedGraphNode(int x) : label(x) {
    };
};


class Solution {
    
public:
    /** * @param graph: A list of Directed graph node * @return: Any topological order for the given graph. */
    vector<DirectedGraphNode*> topSort(vector<DirectedGraphNode*> graph) {
    
        // write your code here
    }
};

title

The practical meaning of topological order is ： In this order , At the beginning of each project , To ensure that all its precursor activities have been completed , So that the whole project can proceed smoothly .

Be careful , Sometimes the topological order is not unique , So when interviewing, ask the following examiners , It's asking for an arbitrary solution , Or list all the solutions .

DFS