- Depth First Search (DFS)
- Breadth First Search (BFS)
- Shortest Path from every vertex to every other vertex **Floyd Warshall**
- Shortest Path from source to all vertices **Dijkstra**
- To detect cycle in a Graph **Union Find**
- Minimum Spanning tree **Kruskal**
- Minimum Spanning tree **Prim**
- Boggle (Find all possible words in a board of characters)
- Topological Sort
- Bridges in a Graph
This blog is intended to provide frequently asked interview questions and answers.
Graph algorithms
Subscribe to:
Post Comments (Atom)
What is Normalization?
Database normalization is a data design and organization process applied to data structures based on rules that help building relational dat...
No comments:
Post a Comment