## Find the girth of a connected undirected graph

Write a c++ program to Find the girth of a connected undirected graph. A girth of a graph is defined as length of shortest cycle contained in the graph....

## Maximum Bipartite Matching

Before learning maximum bipartite matching let us understand the meaning of bipartite graph. A graph is said to be bipartite if the vertices in the graph can be partitioned...

## Check whether a given graph is connected or not

Write a c++ program to check whether a given graph is connected or not using DFS method. A graph is said to be connected when there is a path...

## articulation point or cut vertex in graph

Articulation point or cut vertex in graph is a vertex of a graph where if we remove this vertex, the graph becomes disconnected. For example the below graph becomes...

## vertex cover problem in graph

Vertex cover problem in a given graph is a problem to find the minimum number of vertices which covers every edges in graph. The minimum number of vertices is...

## How to check whether a directed graph is eulerian

This blogs teaches the steps for how to check whether a directed graph is eulerian. A graph is called Eulerian if it contains Euler Cycle o Euler circuit. If...