Developer docs · Algorithms
Graph traversal · Shortest paths & minimum spanning trees · Dynamic programming · Greedy algorithms · Divide and conquer · Backtracking
Graph traversal visits every reachable vertex with BFS or DFS, the basis for unweighted shortest paths, components, cycle detection and topological sorting.
6-chapter guideFind shortest paths with Dijkstra, Bellman-Ford and Floyd-Warshall, and build minimum spanning trees with Kruskal and Prim.
6-chapter guideDynamic programming stores the answers to overlapping subproblems and reuses them, turning exponential searches into efficient table-filling algorithms.
6-chapter guideGreedy algorithms take the locally best choice at each step and never look back, solving interval scheduling, Huffman coding and fractional knapsack fast.