mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-22 05:21:49 +03:00
Add Bellman-Ford Algorithm
This commit is contained in:
parent
909f00c605
commit
901b5c2ba8
126
data_structures/graphs/Bellman-Ford.c
Normal file
126
data_structures/graphs/Bellman-Ford.c
Normal file
@ -0,0 +1,126 @@
|
||||
#include<stdio.h>
|
||||
#include<stdlib.h>
|
||||
#include<limits.h>
|
||||
#include<string.h>
|
||||
|
||||
//Structure for storing edge
|
||||
struct Edge{
|
||||
int src,dst,weight;
|
||||
};
|
||||
|
||||
//Structure for storing a graph
|
||||
struct Graph{
|
||||
int vertexNum;
|
||||
int edgeNum;
|
||||
struct Edge* edges;
|
||||
};
|
||||
|
||||
//Constructs a graph with V vertices and E edges
|
||||
void createGraph(struct Graph* G,int V,int E){
|
||||
G->vertexNum = V;
|
||||
G->edgeNum = E;
|
||||
G->edges = (struct Edge*) malloc(E * sizeof(struct Edge));
|
||||
}
|
||||
|
||||
//Adds the given edge to the graph
|
||||
void addEdge(struct Graph* G, int src, int dst, int weight){
|
||||
static int ind;
|
||||
struct Edge newEdge;
|
||||
newEdge.src = src;
|
||||
newEdge.dst = dst;
|
||||
newEdge.weight = weight;
|
||||
G->edges[ind++]= newEdge;
|
||||
}
|
||||
|
||||
|
||||
//Utility function to find minimum distance vertex in mdist
|
||||
int minDistance(int mdist[], int vset[], int V){
|
||||
int minVal = INT_MAX, minInd ;
|
||||
for(int i=0; i<V;i++)
|
||||
if(vset[i] == 0 && mdist[i] < minVal){
|
||||
minVal = mdist[i];
|
||||
minInd = i;
|
||||
}
|
||||
|
||||
return minInd;
|
||||
}
|
||||
|
||||
//Utility function to print distances
|
||||
void print(int dist[], int V){
|
||||
printf("\nVertex Distance\n");
|
||||
for(int i = 0; i < V; i++)
|
||||
printf("%d\t%d\n",i,dist[i]);
|
||||
}
|
||||
|
||||
//The main function that finds the shortest path from given source
|
||||
//to all other vertices using Bellman-Ford.It also detects negative
|
||||
//weight cycle
|
||||
void BellmanFord(struct Graph* graph, int src){
|
||||
int V = graph->vertexNum;
|
||||
int E = graph->edgeNum;
|
||||
int dist[V];
|
||||
|
||||
//Initialize distances array as INF for all except source
|
||||
//Intialize source as zero
|
||||
for(int i=0; i<V; i++)
|
||||
dist[i] = INT_MAX;
|
||||
dist[src] = 0;
|
||||
|
||||
//Calculate shortest path distance from source to all edges
|
||||
//A path can contain maximum (|V|-1) edges
|
||||
for(int i=0; i<=V-1; i++)
|
||||
for(int j = 0; j<E; j++){
|
||||
int u = graph->edges[j].src;
|
||||
int v = graph->edges[j].dst;
|
||||
int w = graph->edges[j].weight;
|
||||
|
||||
if(dist[u]!=INT_MAX && dist[u] + w < dist[v])
|
||||
dist[v] = dist[u] + w;
|
||||
}
|
||||
|
||||
//Iterate inner loop once more to check for negative cycle
|
||||
for(int j = 0; j<E; j++){
|
||||
int u = graph->edges[j].src;
|
||||
int v = graph->edges[j].dst;
|
||||
int w = graph->edges[j].weight;
|
||||
|
||||
if(dist[u]!=INT_MAX && dist[u] + w < dist[v]){
|
||||
printf("Graph contains negative weight cycle. Hence, shortest distance not guaranteed.");
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
print(dist, V);
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
|
||||
|
||||
//Driver Function
|
||||
int main(){
|
||||
int V,E,gsrc;
|
||||
int src,dst,weight;
|
||||
struct Graph G;
|
||||
printf("Enter number of vertices: ");
|
||||
scanf("%d",&V);
|
||||
printf("Enter number of edges: ");
|
||||
scanf("%d",&E);
|
||||
createGraph(&G,V,E);
|
||||
for(int i=0; i<E; i++){
|
||||
printf("\nEdge %d \nEnter source: ",i+1);
|
||||
scanf("%d",&src);
|
||||
printf("Enter destination: ");
|
||||
scanf("%d",&dst);
|
||||
printf("Enter weight: ");
|
||||
scanf("%d",&weight);
|
||||
addEdge(&G, src, dst, weight);
|
||||
}
|
||||
printf("\nEnter source:");
|
||||
scanf("%d",&gsrc);
|
||||
BellmanFord(&G,gsrc);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user