Category: Graph

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…

https://www.youtube.com/watch?v=Q9PIxaNGnig/ code: // A Java program to print topological sorting of a DAG import java.io.*; import java.util.*;…

Theory: http://scanftree.com/Data_Structure/Breadth-First-Search Bangla: গ্রাফ থিওরিতে হাতেখড়ি-৪(ব্রেডথ ফার্স্ট সার্চ) Video: code implementation: Some other links may help: http://theoryofprogramming.com/2014/12/25/breadth-first-search-algorithm/…

Discovery Time and Finishing Time Code: //dfs using adjacency list in directed graph #include<iostream> using namespace std;…