Implementation of the popular Data Structures and Algorithms
- Undirected Graph (Adjacency Matrix)
- Undirected Graph (Adjacency List)
- Directed Graph (Adjacency List)
- BFS Traversal
- DFS Recursive Traversal
- DFS Iterative Traversal
- Check for cycle in Undirected Graph
- Shortest Distance from a source in a unweighted Undirected Graph
- Check for cycle in Directed Graph
- Topological Sort (BFS Kahn's Algorithm)
- Check for cycle in Directed Graph (BFS Kahn's Algorithm)
- Topological Sort (DFS)
- Directed Weighted Graph(Adjacency List)
- Shortest Path in Directed Acyclic Graph (DAG)
- Undirected Weighted Graph
- Dijkstra's Shortest Path
- Prim's Minimum Spanning Tree
- Kosaraju's Strongly Connected Component
- Bellman Ford Shortest Path
- Kruskal's Minimum Spanning Tree
- Inorder Traversal (Iterative)
- Inorder Traversal (Recursive)
- Preorder Traversal (Iterative)
- Preorder Traversal (Recursive)
- Postorder Traversal (Iterative)
- Postorder Traversal (Recursive)
- BFS Traversal / Level order Traversal
- Level order Traversal(Line By Line)
- Spiral Level order Traversal(Line By Line)