【数据结构】AOV网与拓扑排序

typedef struct ArcNode{
            //边结点 
    int adjvex;                 //顶点下标 
    ArcNode *next;
}ArcNode;

typedef struct{
   
    int in;                     //in是入度 
    string vertex;              //顶点信息 
    ArcNode *firstEdge;             
}vertexNode,VertexNode[MAX];

#include<iostream>
#include<cstring>
#include<stack>
#define MAX 100

using namespace std;

typedef struct ArcNode {
   
	int adjvex;
	ArcNode * next;
} ArcNode;

typedef struct {
   
	int in;
	string vertex;
	ArcNode * firstEdge;
} vertexNode, VertexNode[MAX];

class ALGraph {
   
	private:
		int vertexNum, arcNum; //顶点数，边数
		VertexNode adjList;