Write a function that returns true if a given undirected graph is tree and false otherwise. For example, the following graph is a tree.
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.
Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if
A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph.
A directed graph is strongly connected if there is a path between all pairs of vertices.
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 »
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 »
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 »
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 »
Depth-first search (DFS) is an algorithm (or technique) for traversing a graph.