c语言-邻接矩阵-数组表示

#pragma once

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

#define Default_Vertex_Size 10
#define T char

typedef struct GraphMtx
{
    int MaxVertices; //最大的定点数
    int NumVertices; //顶点数
    int NumEdges;    //边数

    T   *VerticesList; //顶点 ADCDEF
    int **Edge;

}GraphMtx;


int GetVertexPos(GraphMtx *g,T v);
void InitGraph(GraphMtx *g);
void ShowGraph(GraphMtx *g);
void InsertVertex(GraphMtx *g,T v);
void InsertEdge(GraphMtx *g,T v1, T v2);
void RemoveEdge(GraphMtx *g,T v1, T v2);
void RemoveVertex(GraphMtx *g,T v);


void DestroyGraph(GraphMtx *g);
int GetFirstNeighbor(GraphMtx *g ,T v);
int GetNextNeighbor(GraphMtx *g ,T v,T w);

#include"GraphMtx.h"


void InitGraph(GraphMtx *g){
    g->MaxVertices=Default_Vertex_Size;
    g->NumVertices=g->NumEdges=0;

    g->VerticesList=(T*)malloc(sizeof(T)*(g->MaxVertices));
    assert(g->VerticesList!=NULL);

    g->Edge=(int **)malloc(sizeof(int *)*g->MaxVertices);
    assert(g->Edge!=NULL);
    int i;
    for ( i = 0; i < g->MaxVertices; ++i)
    {
        g->Edge[i]=(int *)malloc(sizeof(int)*g->MaxVertices);
    }

    for (i = 0; i < g->MaxVertices; ++i)
    {
        for(int j=0;j<g->MaxVertices;++j){
            g->Edge[i][j]=0;
        }
    }
}

void ShowGraph(GraphMtx *g){
    int i;
    printf("   ");
    for(i=0;i<g->NumVertices;i++){
            printf("%3c",g->VerticesList[i]);
    }
    printf("\n");

    for(i=0;i<g->NumVertices;++i){
        printf("%3c",g->VerticesList[i]);
        for(int j=0;j<g->NumVertices;++j){
            printf("%3d",g->Edge[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}

void InsertVertex(GraphMtx *g,T V){
    if(g->NumVertices >= g->MaxVertices)
        return;
    g->VerticesList[g->NumVertices++]= V;
}

int  GetVertexPos(GraphMtx *g, T v)
{
	for(int i=0; i<g->NumVertices; ++i)
	{
		if(g->VerticesList[i] == v)
			return i;
	}
	return -1;
}


void InsertEdge(GraphMtx *g,T v1, T v2){
    int p1=GetVertexPos(g,v1);
    int p2=GetVertexPos(g,v2);
    if(p1==-1||p2==-1)
        return;
    if(g->Edge[p1][p2]!=0)
        return;
    g->Edge[p1][p2]=g->Edge[p2][p1]=1;
    g->NumEdges++;
    
}

 void RemoveEdge(GraphMtx *g,T v1, T v2){
    int p1=GetVertexPos(g,v1);
    int p2=GetVertexPos(g,v2);
    if(p1==-1||p2==-1)
        return ;
    if(g->Edge[p1][p2]==0)
        return;
    g->Edge[p1][p2]=g->Edge[p2][p1]=0;
    g->NumEdges--;
 }

 void RemoveVertex(GraphMtx *g,T v){
    int p=GetVertexPos(g,v);
    if(p==-1)
        return;
    int i;
    //删除列名
    for(i=p;i<g->NumVertices-1;++i){
        g->VerticesList[i]=g->VerticesList[i+1];
    }
    //计算删除边的数
    int numedges=0;
    for(i=0;i<g->NumVertices;++i)
    {
        if(g->Edge[p][i]!=0)
        {
            numedges++;
        }
    }


    //消除行
    for(i=p;i<g->NumVertices-1;++i){
        for (int j=0; j<g->NumVertices;++j){
            g->Edge[i][j]=g->Edge[i+1][j];
        }
    }
    //消除列
    for(i=p;i<g->NumVertices;++i){
        for (int j = 0; j < g->NumVertices; ++j)
        {
            g->Edge[j][i]=g->Edge[j][i+1];
        }
    }
    g->NumVertices--;
    g->NumEdges-=numedges;
 }

void DestroyGraph(GraphMtx *g){
    free(g->VerticesList);
    g->VerticesList=NULL;
    for(int i=0;i<g->NumVertices;++i){
        free(g->Edge);
    }
    free(g->Edge);
    g->Edge=NULL;
    g->MaxVertices=g->NumEdges=g->NumVertices=0;
}
int GetFirstNeighbor(GraphMtx *g ,T v){
    int p=GetVertexPos(g,v);
    if(p==-1)
        return -1;
    for (int i = 0; i < g->NumVertices; i++)
    {
        if(g->Edge[p][i]==1)
            return i;
    }
    return -1;
    
    
}
int GetNextNeighbor(GraphMtx *g ,T v,T w)
{
    int pv=GetVertexPos(g,v);
    int pw=GetVertexPos(g,w);
    if(pv!=-1||pw!=-1)
        return -1;
    for (int i = pw+1; i < g->NumVertices; ++i)
    {
        if(g->Edge[pv][i]==1)
            return i;
        
    }
    return -1;  
}

#include"GraphMtx.h"


void main(){
    GraphMtx gm;
    InitGraph(&gm);

    InsertVertex(&gm,'A');
    InsertVertex(&gm,'B');
    InsertVertex(&gm,'C');
    InsertVertex(&gm,'D');
    InsertVertex(&gm,'E');

    InsertEdge(&gm,'A','B');
    InsertEdge(&gm,'A','D');
    InsertEdge(&gm,'B','C');
    InsertEdge(&gm,'B','E');
    InsertEdge(&gm,'C','E');
    InsertEdge(&gm,'C','D');
    //int p=GetFirstNeighbor(&gm,'D');
    int p=GetNextNeighbor(&gm,'C','B');
    printf("%d",p);
    ShowGraph(&gm);

    RemoveVertex(&gm,'C');
	ShowGraph(&gm);

}