##
Detect cycle in an undirected graph
October 11, 2013

Given an undirected graph, how to check if there is a cycle in the graph? For example, the following graph has a cycle 1-0-2-1.

October 11, 2013

Given an undirected graph, how to check if there is a cycle in the graph? For example, the following graph has a cycle 1-0-2-1.

September 27, 2013

Given a directed graph and two vertices in it, source ‘s’ and destination ‘t’, find out the maximum number of edge disjoint paths from s to t.

September 19, 2013

Given a Weighted Directed Acyclic Graph (DAG) and a source vertex s in it, find the longest distances from s to all other vertices in the given graph.

August 3, 2013

Eulerian Path is a path in graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path which starts and ends on the same vertex.

July 20, 2013

Given N men and N women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together

July 18, 2013

In a flow network, an s-t cut is a cut that requires the source ‘s’ and the sink ‘t’ to be in different subsets, and it consists of edges going from the source’s side to the sink’s side.

July 16, 2013

A matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint. A maximum matching is a matching of maximum size (maximum number of edges).

July 3, 2013

Given a graph which represents a flow network where every edge has a capacity. Also given two vertices source ‘s’ and sink ‘t’ in the graph, find the maximum possible flow from s to t with following constraints:

June 13, 2013

June 2, 2013

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if

May 23, 2013

An undirected graph is called Biconnected if there are two vertex-disjoint paths between any two vertices.