3.8. Graph

• 3.8.1. Representation of Graph
  • 3.8.1.1. Adjacency Matrix
  • 3.8.1.2. Adjacency List
  • 3.8.1.3. Edge List
  • 3.8.1.4. Logical Graph
• 3.8.2. BFS
  • 3.8.2.1. Shortest Distance from All Buildings
• 3.8.3. DFS
• 3.8.4. Topological Sort
  • 3.8.4.1. Post-order DFS
  • 3.8.4.2. Kahn Algo - BFS with Zero-Degree Nodes
  • 3.8.4.3. Shortest Path Search
• 3.8.5. Minimum Spanning Tree
  • 3.8.5.1. A Sample Question
  • 3.8.5.2. Prim Algorithm
  • 3.8.5.3. Kruskal Algorithm
• 3.8.6. Single-Source Shortest Paths
  • 3.8.6.1. Dijkstra Algorithm
  • 3.8.6.2. Bellman Ford Algorithm
  • 3.8.6.3. A-Star Algorithm
• 3.8.7. All-Pairs Shortest Paths
• 3.8.8. Other Graph Algorithms
  • 3.8.8.1. Bipartite
  • 3.8.8.2. Strongly Connected Components
• 3.8.9. Questions
  • 3.8.9.1. Babyfaces And Heels
  • 3.8.9.2. Is Graph A Valid Tree?
  • 3.8.9.3. Walls and Gates
  • 3.8.9.4. Word Ladder
  • 3.8.9.5. Word Ladder II
  • 3.8.9.6. Expression Add Operators
  • 3.8.9.7. Course Schedule
  • 3.8.9.8. Course Schedule II
  • 3.8.9.9. Reconstruct Itinerary
  • 3.8.9.10. Alien Dictionary
  • 3.8.9.11. Is Graph Bipartite?
  • 3.8.9.12. Cheapest Flights Within K Stops
  • 3.8.9.13. Lowest Price With Shopping Offers
  • 3.8.9.14. Valid Path With Landmark
  • 3.8.9.15. Minimum Height Trees
  • 3.8.9.16. Reconstruct Graph With Parent Nodes When Peeling Nodes
  • 3.8.9.17. Shortest Path in a Grid with Obstacles Elimination
  • 3.8.9.18. Wall In Gird World
  • 3.8.9.19. 8-Puzzle
  • 3.8.9.20. Magic Squares
  • 3.8.9.21. Sort Matrix By Swap
  • 3.8.9.22. Robot Car
  • 3.8.9.23. Expression Add Operators
  • 3.8.9.24. Flight Route With Max Fun
  • 3.8.9.25. Create Recipes
  • 3.8.9.26. Network Delay Time
  • 3.8.9.27. City Traveler
  • 3.8.9.28. Count Lakes