Update BellmanFord.c

ushmita4 · web-flow · commit fdb57e8ac955 · 2021-07-23T19:21:42.000+05:30
diff --git a/Data Structures/Graphs/Bellman Ford.c b/Data Structures/Graphs/Bellman Ford.c
@@ -1,3 +1,5 @@
+
+/*The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Bellman Ford's Algorithm comes into the picture when there is a negative weight edge. It also detects any negative weight cycle if present.**/
 #include <stdio.h>
 #include <stdlib.h>
 /*Time Complexity:- O(VE)**/

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+`
	`2`	`+/The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Bellman Ford's Algorithm comes into the picture when there is a negative weight edge. It also detects any negative weight cycle if present.*/`
`1`	`3`	`#include <stdio.h>`
`2`	`4`	`#include <stdlib.h>`
`3`	`5`	`/Time Complexity:- O(VE)*/`