// 1. Breadth First Search (BFS)
// 2. Depth First Search (DFS)
// 3. Shortest Path from source to all vertices **Dijkstra**
// 4. Shortest Path from every vertex to every other vertex **Floyd Warshall**
// 5. To detect cycle in a Graph **Union Find**
// 6. Minimum Spanning tree **Prim**
// 7. Minimum Spanning tree **Kruskal**
// 8. Topological Sort
// 9. Boggle (Find all possible words in a board of characters)
// 10. Bridges in a Graph


