##
Connected Components in an undirected graph
June 12, 2015

Given an undirected graph, print all connected components line by line. For example consider the following graph.

June 12, 2015

Given an undirected graph, print all connected components line by line. For example consider the following graph.

April 12, 2015

Given a list of word lists How to print all sentences possible taking one word from a list at a time via recursion?

January 15, 2015

Given a directed graph, a source vertex ‘s’ and a destination vertex ‘d’, print all paths from given ‘s’ to ‘d’.

January 2, 2015

Given a dictionary, a method to do lookup in dictionary and a M x N board where every cell has one character. Find all possible… Read More »

October 20, 2014

Write a function that returns true if a given undirected graph is tree and false otherwise. For example, the following graph is a tree.

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.

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 21, 2013

A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph.

May 16, 2013

A directed graph is strongly connected if there is a path between all pairs of vertices.

May 12, 2013

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v… Read More »

October 17, 2012

Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 5… Read More »

April 3, 2012

Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least… Read More »

March 15, 2012

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs… Read More »

March 25, 2011

Depth-first search (DFS) is an algorithm (or technique) for traversing a graph.