图的表示

1. 邻接矩阵

输入格式：

Nv,Ne  //定点数，边数

V1,V2,weight   //一条边权重

typedef struct GNode *PtrToGNode;
struct GNode{
    int Nv;//node number
    int Ne;//edge number
    int G[maxvertexnumber][maxvertexnumber];//matrix
    //int Data[maxvertexnumber]; data
}
typedef PtrToGNode MGraph;
//初始化一个有Nv个顶点，没有边的图
MGraph CreatGraph(int Nv){
    int V,W;
    MGraph Graph;
    Graph=(MGraph)malloc(sizeof(struct GNode));
    Graph->Nv=Nv;
    Graph->Ne=0;
    for(V=0;V<Graph->Nv;V++){
        for(W=0;W<Graph->Nv;W++){
            Graph->G[V][W]=0;
        }
    }
    return Graph;
}
//向图中插入边
struct ENode{
    int V1,V2;//两个顶点
    int weight;//权重
}
typedef struct ENode *Edge;
void InsertEdge(MGraph Graph,Edge E){
    Graph->G[E->V1][E->V2]=E->weight;
    //无向图
    Graph->G[E->V2][E->V1]=E->weight;
}

MGraph BuildGraph(){
    MGraph Graph;
    int Nv,i;
    Edge E;
    scanf("%d",&Nv);
    Graph=CreatGraph(Nv);
    scanf("%d",&(Graph->Ne));
    if(Graph->Ne!=0){
        E=(Edge)malloc(sizeof(struct ENode));
        for(i=0;i<Graph->Ne;i++){
            scanf("%d %d %d",&(E->V1),&(E->V2),&(E->weight));
            InsertEdge(Graph,E);
        }
    }
    return Graph;
}

2.邻接表(输入格式与上面相同)

typedef struct VNode *ListNode;
struct VNode{
    int AdjV;       //邻接表一个节点
    int Weight;
    ListNode Next;
}

typedef struct PtrNode{
    ListNode FirstEdge;
}AdjList[MaxVertexNumber];

struct GNode{
    int Nn,Ne;
    AdjList G;
}
typedef struct GNode *LGraph;
//初始化一个有Nn个顶点，无边的图
CreatGraph(int Nn){
    int i;
    LGraph Graph;
    Graph=(LGraph)malloc(sizeof(struct GNode));
    Graph->Nn=Nn;
    Graph->Ne=0;
    for(i=0;i<Graph->Nn;i++){
        Graph->G[i].FirstEdge=NULL;
    }
    return Graph;
}

struct ENode{
    int V1,V2;//两个顶点
    int weight;//权重
}
typedef struct ENode *Edge;

void InsertEdge(LGraph Graph,Edge E){
    ListNode NewNode;
    NewNode=(listNode)malloc(sizeof(struct VNode));
    NewNode->AdjV=E->V2;
    NewNode->Weight=E->weight;
    NewNode->next=Graph->G[E->V1].FirstEdge;
    Graph->G[E->V1].FirstEdge=NewNode;
    //无向图+
    NewNode=(ListNode)malloc(sizeof(struct VNode));
    NewNode->AdjV=E->V1;
    NewNode->Weight=E->weight;
    NewNode->next=Graph->G[E->V2].FirstEdge;
    Graph->G[E->V2].FirstEdge=NewNode;
}

LGraph BuildGraph(){
    LGraph Graph;
    int Nn,i;
    Edge E;
    scanf("%d",&Nn);
    Graph=CreatGraph(Nn);
    scanf("%d",&(Graph->Ne));
    if(Graph->Ne!=0){
        E=(Edge)malloc(sizeof(struct ENode));
        for(i=0;i<Graph->Ne;i++){
            scanf("%d %d %d",&(E->V1),&(E->V2),&(E->weight));
            InsertEdge(Graph,E);
        }
    }
    return Graph;
}