- Related Questions & Answers
- Introduction to Backtracking Algorithms
- Introduction to Searching Algorithms
- Introduction to Greedy Algorithms
- Introduction to Pattern Searching Algorithms
- Introduction to Analysis of Algorithms
- Introduction to Divide & Conquer Algorithms
- Introduction to Algorithms for Mathematical Problems
- Introduction to Databases
- Introduction to Backtracking
- Rebalancing Algorithms
- Introduction to Miscellaneous Problems
- Introduction to Sorting Techniques
- Introduction to Dynamic Programming
- Introduction to Mathematical Logic!
- Sudoku Solving algorithms

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

The graph is a non-linear data-structure, which consists finite number of nodes and a set of edges which are used to connect a pair of nodes.

The graphs are used to solve some real-time problems to represent network etc. In different social networks, the graphs are used.

In this Section We are going to cover −

- Bi-Connected Graph Checking
- Breadth First Search (BFS) for a Graph
- Bridges in a Graph
- Check if a given graph is tree or not
- Connectivity in a directed graph
- Depth First Search (DFS) for a Graph
- Detect Cycle in a an Undirected Graph
- Detect Cycle in a Directed Graph
- Euler Circuit in a Directed Graph
- Eulerian Path and Circuit
- Fleury’s Algorithm
- Graph Coloring
- How to find if a graph is Bipartite?
- Longest Path in a Directed Acyclic Graph
- Shortest Path in a Directed Acyclic Graph
- Maximum Bipartite Matching
- Shortest path with exactly k Edges
- Snake and Ladder Problem
- Strongly Connected Graphs
- Tarjan's Algorithm for Strongly Connected Components
- Topological Sorting
- Transitive closure of a Graph
- Ford Fulkerson Algorithm
- Check For Star Graph
- Bellman–Ford Algorithm for Shortest Paths

Advertisements