c语言简易邻接表实现建立有向图及无向图上的dijstra最短路算法（记录路径）（不弱智版）

本文主要是介绍c语言简易邻接表实现建立有向图及无向图上的dijstra最短路算法（记录路径）（不弱智版），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

课本里讲的真的弱智，描述一个图好几个结构体嵌套到一块，真的头疼，正好考研的同学问到我相关的大题，就稍微写一下，代码很简单，不怎么需要注释应该能看懂

文件1是邻接表建有向图（无权）
文件2是邻接表实现dijstra算法（无权）（有注释）

#include<stdio.h>
#include<malloc.h>typedef struct node
{int id;int weight;struct node *next;
}gnode, *gnodeptr;create(gnodeptr* p)
{(*p) = (gnodeptr)malloc(sizeof(gnode));
}int main()
{gnode g[100];int n,m,i,j;scanf("%d%d", &n, &m);for(i=0;i<n;i++){int k;scanf("%d", &k);g[k].id = k;g[k].weight = -1;g[k].next = NULL;}for(i=0;i<m;i++){int k,l;scanf("%d%d", &k, &l);gnodeptr temp;create(&temp);temp->id = l;temp->weight = 1;temp->next = NULL;temp->next = g[k].next;g[k].next = temp;}for(i=0;i<n;i++){gnode temp = g[i];while(1){printf("%d-> ", temp.id);if(temp.next == NULL)  break;temp = *(temp.next);}printf("\n");}
}/*
2 2
0 1
0 1
1 0
*/


#include<stdio.h>
#include<malloc.h>typedef struct node
{int id;int weight;struct node *next;
}gnode, *gnodeptr;create(gnodeptr* p)
{(*p) = (gnodeptr)malloc(sizeof(gnode));
}int dijstra(gnode g[], int n, int m, int start, int end)
{int visited[100], loop,i;int distance[100];int path[100];for(i=0;i<n;i++){visited[i] = 0;distance[i] = 99999;path[i] = -1;}distance[start] = 0;gnodeptr temp = &(g[start]);for(loop=0;loop<n;loop++){int min_index, min_index_dis = 99999;for(i=0;i<n;i++){if(distance[i] < min_index_dis && visited[i] == 0){min_index = i;min_index_dis = distance[i];}}if(min_index == end){int p = end;while(1){printf("%d<-", p);p = path[p];if(p == start){printf("%d\n", p);break;}}return min_index_dis;}visited[min_index] = 1;gnodeptr temp = (&(g[min_index]))->next;for(;temp != NULL;temp = temp->next){if(visited[temp->id]==0 && distance[temp->id] > min_index_dis + 1){distance[temp->id] = min_index_dis + 1;// 记录路径，被更新点的前驱path[temp->id] = min_index;}}/*for(;temp != NULL;temp = temp->next){if(visited[temp->id]==0 && distance[temp->id] > distance[min_index] + temp.weight){distance[temp->id] = distance[min_index] + temp.weight;}}*/}
}int main()
{gnode g[100];int n,m,i,j;scanf("%d%d", &n, &m);for(i=0;i<n;i++){int k;scanf("%d", &k);g[k].id = k;g[k].weight = -1;g[k].next = NULL;}// 建图for(i=0;i<m;i++){// 建第一条边int k,l;scanf("%d%d", &k, &l);gnodeptr temp, temp2;create(&temp);temp->id = l;temp->weight = 1;temp->next = NULL;temp->next = g[k].next;g[k].next = temp;// 第二个反向边create(&temp2);temp2->id = k;temp2->weight = 1;temp2->next = NULL;temp2->next = g[l].next;g[l].next = temp2;}// 图的邻接表的可视化for(i=0;i<n;i++){gnode temp = g[i];while(1){printf("%d-> ", temp.id);if(temp.next == NULL)  break;temp = *(temp.next);}printf("\n");}int start, end;while(1){scanf("%d%d", &start, &end);int ans = dijstra(g, n, m, start, end);printf("min distance equal %d\n", ans);}
}/*
4 4
0 1 2 3
0 1
0 2
1 2
2 34 6
0 1 2 3
0 1
0 2
0 3
1 2
2 3
3 14 3
0 1 2 3
0 3
3 2
1 26 5
0 1 2 3 4 5
0 3
3 2
2 1
2 4
4 57 9
0 1 2 3 4 5 6
0 3
0 5
3 2
2 1
2 6
1 4
2 5
4 5
4 6
*/