邻接矩阵有向图的介绍

// 邻接矩阵
typedef struct _graph
{
    char vexs[MAX];       // 顶点集合
    int vexnum;           // 顶点数
    int edgnum;           // 边数
    int matrix[MAX][MAX]; // 邻接矩阵
}Graph, *PGraph;

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<malloc.h>
#define MAX 100
typedef struct graph
{
    char vexs[MAX];
    int vexnum;
    int edgnum;
    int matrix[MAX][MAX];
} Graph,*graph;

static int get_position(Graph g,char ch)
{
    int i;
    for(i=0;i<g.vexnum;i++)
        if(g.vexs[i]==ch)
            return i;
    return -1;
}

graph create_graph()
{
    char vexs[]= {‘A‘,‘B‘,‘C‘,‘D‘,‘E‘,‘F‘,‘G‘};
    char edges[][2]= {{‘A‘,‘C‘},{‘A‘,‘D‘},{‘A‘,‘F‘},{‘B‘,‘C‘},{‘C‘,‘D‘},{‘E‘,‘G‘},{‘F‘,‘G‘}};
    int vlen=sizeof(vexs)/sizeof(vexs[0]);
    int  elen=sizeof(edges)/sizeof(edges[0]);
    int i,p1,p2;
    Graph *pG;
    if((pG=(graph)malloc(sizeof(Graph)))==NULL)
        return NULL;
    pG->edgnum=elen;
    pG->vexnum=vlen;
    for(i=0;i<pG->vexnum;i++)
        pG->vexs[i]=vexs[i];
    for(i=0;i<pG->edgnum;i++)
    {
        p1=get_position(*pG,edges[i][0]);
        p2=get_position(*pG,edges[i][1]);
        pG->matrix[p1][p2]=1;
    }
    return pG;
}

void print_graph(Graph G)
{
    int i,j;
    for(i=0;i<G.vexnum;i++)
    {
        for(j=0;j<G.edgnum;j++)
        {
            printf("%d ",G.matrix[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}

int main()
{
    Graph *pG;
    pG=create_graph();
    print_graph(*pG);
}