Graph algorithms
↑Graphs model locations and relationships. Learn BFS and DFS before moving to weighted shortest paths such as Dijkstra or A*, where edge costs and heuristics change the problem.
How to study this section
Section titled “How to study this section”Start with one concept, work through a small example, and verify your prediction. Follow linked topics when a prerequisite or related idea needs more explanation.
Explore guides and subcategories
Section titled “Explore guides and subcategories”Articles