Dijkstra's Algorithm Matrix
#include <stdio.h> #include <stdlib.h> #include <limits.h> #define MAX 100 #define INF INT_MAX int adj[MAX][MAX]; int dist[MAX]; int pred[MAX]; int visited[MAX]; void create_graph(int n, int gtype); void dijkstra(int n, int source); void print_shortest_path(int source, int destination); int main() { int n, gtype, source; printf("Enter 1 for undirected graph and -1 for directed graph: "); scanf("%d", >ype); printf("Enter the number of vertices: "); scanf("%d", &n); create_graph(n, gtype); printf("Enter the source vertex: "); scanf("%d", &source); dijkstra(n, source); for (int i = 0; i < n; i++) { if (i != source) { printf("Shortest path from vertex %d to vertex %d: ", source, i); print_shortest_path...
Comments
Post a Comment