有向图---邻接表（BFS+DFS）

    #include <stdio.h>
#include <malloc.h>

#define true 1
#define false 0
#define INFINITY 1000000
#define MaxVertexNum 100
#define MaxArcNum 100


struct ArcNode {
    int vname;
    int dist;
    struct ArcNode* Next;
};
struct VerNode {
    struct ArcNode* First;
};
struct GraphStruct {
    int vexnum, arcnum;
    struct VerNode list[MaxVertexNum];
    int Visited[MaxVertexNum];
};
struct QueueStruct {
    int capacity;
    int rear, front;
    int Array[MaxVertexNum];
};
typedef struct ArcNode* Arc;
typedef struct GraphStruct* Graph;
typedef struct QueueStruct* Queue;

void printfError();
Graph createGraph();
void initializeGraph( Graph G );
Arc createArcNode( int vname, int dist );
void BFS( Graph G, int u );
void DFS( Graph G, int u );
void enQueue( Queue q, int u );
int deQueue( Queue q );
Queue createQueue();
void initializeQueue( Queue q );

int main( void ) {

    Graph G = createGraph();
    int i = 0;
    int V1, V2, dist