[hihoCoder] 拓扑排序·一

The hints of the problem has given detailed information to implement the topological sorting algorithm. In fact, the toposort algorithm of the hint is the BFS version, which uses the indegrees of each node.

The code is as follows.

 #include <iostream>
 #include <vector>
 #include <queue>

 using namespace std;

 struct DirectedGraphNode {
     int label;
     vector<int> neighbors;
     DirectedGraphNode(int i) : label(i) {}
 };

 vector<DirectedGraphNode*> init_graph(int nodes) {
     vector<DirectedGraphNode*> graph(nodes);
     for (int i = ; i < nodes; i++)
         graph[i] = new DirectedGraphNode(i);
     return graph;
 }

 vector<int> compute_indegree(vector<DirectedGraphNode*>& graph) {
     vector<int> degrees(graph.size(), );
     for (int i = ; i < (int)graph.size(); i++)
         for (int j = ; j < (int)graph[i] -> neighbors.size(); j++)
             degrees[graph[i] -> neighbors[j]]++;
     return degrees;
 }

 bool noCycle(vector<DirectedGraphNode*>& graph) {
     vector<int> degrees = compute_indegree(graph);
     int nodes = graph.size();
     queue<int> zeros;
     for (int i = ; i < (int)degrees.size(); i++)
         if (!degrees[i]) zeros.push(i);
     while (!zeros.empty()) {
         int zero = zeros.front();
         zeros.pop();
         for (int i = ; i < (int)graph[zero] -> neighbors.size(); i++)
             if (--degrees[graph[zero] -> neighbors[i]] == )
                 zeros.push(graph[zero] -> neighbors[i]);
         nodes--;
     }
     return nodes == ;
 }

 int main(void) {
     int cases;
     scanf("%d", &cases);
     for (int i = ; i < cases; i++) {
         int nodes, edges;
         scanf("%d %d", &nodes, &edges);
         vector<DirectedGraphNode*> graph = init_graph(nodes);
         int node, neigh;
         for (int j = ; j < edges; j++) {
             scanf("%d %d", &node, &neigh);
             graph[node - ] -> neighbors.push_back(neigh - );
         }
         if (noCycle(graph)) printf("Correct\n");
         else printf("Wrong\n");
     }
     return ;
 }