代码如下:#include<iostream>#include<list>#include<stack>using namespace std;
class Graph { int vertexNum; list<int> *adjacents;public: Graph(int _vertexNum) { vertexNum = _vertexNum; adjacents = new list<int>[vertexNum]; } void findIndegree(int *indegree, int n); bool topologicalSort(); void addEdge(i
