- Prim’s Minimum Spanning Tree
- N Queen Problem Using Backtracking Algorithm
- Minimum Spanning Tree Using Kruskal’s algorithm
- Find the maximum flow using Ford Fulkerson Method Edmond Karp’s Algorithm.
- Find the number of islands
- Strongly Connected Components by Kosaraju’s algorithm
- Articulation Points Graph Algorithm using torjan’s algorithm (Cut Vertices)
- Graph Vertices Coloring
- Floyd Warshall Algorithm to find shortest path weighted directed Graph.
- Implement Dijkstra
- Snake and Ladder Problem
- Find all possible words in a board of characters (Boggle)
- Topological Sorting
- Minimize Cash Flow among a given set of friends who have borrowed money from each other
- Detect cycle in an undirected graph
- Detect Cycle in a Directed Graph
- Longest Path in a Directed Acyclic Graph with weight
- Check whether a given graph is Bipartite or not
- Longest Path in a Directed Acyclic Graph
- Implement Depth First Traversal for a Graph
- Implement Breadth First Traversal for a Graph
- T9 Dictionary Using DFS
- Duplicate Baby Names Problem
- Count paths between two vertices in undirected graph
- Kruskal Minimum spanning tree based on disjoint set
- Detect Cycle in a Directed Graph
- Alien Language Parser
- Prim’s Minimum Spanning Tree
- Dijkstra Shortest Path Finder
- Topological Sort
- Graph Depth first search traversal (DFS)
- Breadth first search traversal (BFS)
- Adjacency Matrix Graph Implementation
- Adjacency List Graph Implementation
- Hamiltonian Cycle