## c program for bfs using adjacency matrix

write c program for bfs using adjacency matrix. For example the breadth first search of below graph from 0th vertex would be 0 1 2 6 3 4. We...

## Max flow problem Ford Fulkerson algorithm

Max flow problem The max flow problem can be defined as “Given a flow network as directed graph, where each edge has a capacity greater than 0 and two...

## Find shortest paths in DAG using Topological order

Shortest path problem can be defined as a problem to find minimum distance between two vertices/nodes of connected weighted graph.Dijkstra’s algorithm is an efficient algorithm for finding shortest path...

## Hamilton cycle and Path in graph

write a program to find Hamilton cycle and Path in graph. A Hamilton path is a path that visits each vertex of a graph ( directed or undirected )...

## Topological Sorting Using modified DFS

A topological sort of a directed acyclic graph (in short DAG) is a linear ordering of vertices such that if DAG contains a directed edge (u,v), then u appears...

## A recursive implementation of DFS

We have already discussed Depth first search on the link http://wikistack.com/depth-first-traversal-of-graph/. This link has pictorial representation of DFS using stack data structure. Here we are going to implement  recursive...

## Strongly connected component Kosaraju’s Algorithm

Strongly connected component is part or sub-graph of directed graph. The strongly connected component is maximal set (S ) of vertices where every vertex in  set (S) is reachable...