邻接表01

最新推荐文章于 2022-05-10 18:28:29 发布

xxx123112

最新推荐文章于 2022-05-10 18:28:29 发布

阅读量105

点赞数 1

分类专栏： icoding

本文链接：https://blog.csdn.net/m0_51430625/article/details/117267256

版权

图数据结构顶点插入边插入无向图数据结构实现

关键词由CSDN通过智能技术生成

icoding 专栏收录该内容

1 篇文章 0 订阅

订阅专栏


bool insert_vertex(ListGraph *G, VertexType v){
if(locate_vertex(G,v) != -1){ 
    return false; 
}
if(G -> vexnum == MAX_VERTEX_NUM){ 
    return false; 
}
VNode temp ;

temp.data = v;
temp.firstarc  = NULL;
G -> vertex[G -> vexnum] = temp;
G -> vexnum++;
return true;
}


bool insert_arc(ListGraph *G, VertexType v, VertexType w){
if(locate_vertex(G,v) == -1 || locate_vertex(G,w) == -1){
    return false;
}
ArcNode *temp, *p, *q, no_sense;
p = &no_sense;
p -> adjvex = w;
p -> nextarc = NULL;
int i = 0;
int j = 0;
i = locate_vertex(G,v);
j = locate_vertex(G,w);
temp = (G -> vertex[i].firstarc);

if(temp == NULL){
    G -> vertex[i].firstarc = p;
    p -> nextarc = NULL;
    return true;
}

while(temp -> nextarc != NULL && temp -> adjvex != w){
    temp = temp -> nextarc;
}
if(temp -> adjvex == p ->adjvex){
    return false;
}
if(temp -> nextarc == NULL){
    temp -> nextarc = p;
    p -> nextarc = NULL;
    
}
if(G -> type ==UDG){
    i = locate_vertex(G,w);
    if(locate_vertex(G,w) == -1){
        return false;
    }
    //j = locate_vertex(G,w);
    temp = (G -> vertex[v].firstarc);

    if(temp == NULL){
        G -> vertex[i].firstarc = p;
        p -> nextarc = NULL;
        return true;
    }

    while(temp -> nextarc != NULL && temp -> adjvex != w){
        temp = temp -> nextarc;
    }   
    if(temp -> adjvex == p ->adjvex){
        return false;
    }
    if(temp -> nextarc == NULL){
        temp -> nextarc = p;
        p -> nextarc = NULL;
    
    }
}
G -> arcnum++;
return true;
}