XIAO！

#include#includetemplateclass Vector{private: int theSize; //the elements it contains int theCapacity; Object *objects;public: explicit Vector( int initSize = 0 ):

/*输入边，建立邻接表，出边表；拓扑排序：找出入度为零的顶点，删除之，及其出边，更新相邻顶点入度；重复上过程，直到栈为空（栈用来保存度为零的顶点）或待输出顶点数小于输入顶点，有环。*/#include#includeusing namespace std;const int MAXN=10;int n,m;int OUT[MAXN]; //o