# Category - DFS and BFS

## C++ Algorithm – Check if a given graph is tree or not

C++ Algorithm - Check if a given graph is tree or not - Graph Algorithm - Write a function that returns true if a given undirected graph is tree

## Java Algorithm – Check if a given graph is tree or not

Java Algorithm - Check if a given graph is tree or not - Graph Algorithm - Write a function that returns true if a given undirected graph is tree

## Python Algorithm – Biconnected Components

Python Algorithm - Biconnected Components -Graph Algorithm - A biconnected component is a maximal biconnected subgraph.Biconnected Graph is already discuss

## Java Algorithm – Biconnected Components

Java Algorithm - Biconnected Components -Graph Algorithm - A biconnected component is a maximal biconnected subgraph.Biconnected Graph is already discussed

## C++ Algorithm – Biconnected Components

C++ Algorithm - Biconnected Components -Graph Algorithm - A biconnected component is a maximal biconnected subgraph. Biconnected Graph is already discussed

Snake and Ladder Problem - Graph Algorithm - Given a snake and ladder board, find the minimum number of dice throws required to reach

## Java Algorithm – Check whether a given graph is Bipartite or not

Java Algorithm - Check whether a given graph is Bipartite or not - Graph Algorithm - A Bipartite Graph is a graph whose vertices can be divided

## C++ Algorithm – Check whether a given graph is Bipartite or not

C++ Algorithm - Check whether a given graph is Bipartite or not - Graph Algorithm - A Bipartite Graph is a graph whose vertices can be divided

## C++ Algorithm – Topological Sorting

C++ Algorithm - Topological Sorting - Graph Algorithms - Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices.

## Shortest Path-Java Programming-Dijsktra’s algorithm

shortest path java programming - dijsktras's algorithm - Given a graph and a source vertex in graph, find shortest paths from source to all vertices.

X