Graph

In this section we will see basics of Graph and practice problems including: BFS, DFS, detect cycle, Bipartite Check, Dijkstra's Algo, Bellman-Ford Algo, Floyd Warshall Algorithm, MST using Prim’s Algo, MST using Kruskal's Algo etc.
Graph representation in Java (Matrix and List)

Posted on Mar 31, 2024

Depth-First Traversal (DFS) for a graph

Posted on Mar 31, 2024

Breadth First Search or BFS for a Graph

Posted on Mar 31, 2024

Topological Sorting (Using BFS or DFS)

Posted on Mar 31, 2024

Check whether a given graph is Bipartite or not

Posted on Mar 31, 2024

Bellman-Ford Algorithm - Shortest Distance with Negative Edge

Posted on Mar 31, 2024

Detect Cycle in a Directed Graph (Using BFS or DFS)

Posted on Mar 31, 2024

Detect cycle in an undirected graph

Posted on Mar 31, 2024

Dijkstra's Single Source Shortest Path Algorithm

Posted on Mar 31, 2024

Minimum Spanning Tree (Prim's and Kruskal's algorithm)

Posted on Mar 31, 2024