Category: Single Source Shortest Path

It works on negative cycle. Implemented Code: Time Complexity: O([E].[V]) Reference: http://cyberlingo.blogspot.com/2015/07/bellman-ford-algorithm.html

#include<bits/stdc++.h> using namespace std; int main(){ int cost[10][10],path[10][10],i,j,n,p,v,min,index=1; int distance[10],row,column; cout<<“Enter no. of nodes: “; cin>>n; cout<<“Enter…