# 数据结构和算法可视化 / Algorithm Visualizer

> 面向中文学习者的交互式算法与数据结构学习站，包含 92 个可视化条目、四语言代码、可改输入、测验、复杂度速查与学习路径。

> The English catalog currently contains 95 translated entry points with the same interactive visual engines and synchronized code.

本文件是面向机器读者的辅助导航，不代表搜索收录、排名或 AI 引用保证。

## 中文核心入口

- [数据结构和算法可视化](https://algo.illegalscreed.cn/): 交互式数据结构与算法可视化：92 个算法逐步动画、四语言代码同步高亮、自定义输入、测验模式、复杂度速查与学习路径。
- [算法复杂度速查](https://algo.illegalscreed.cn/docs/complexity/): 按九大类查找常见数据结构与算法的时间复杂度、空间复杂度和适用说明，并支持关键词与分类筛选。
- [算法学习路径](https://algo.illegalscreed.cn/docs/paths/): 提供新手入门、面试高频、图论专线与进阶专题四条算法学习路径，按前置关系逐站学习。

## 中文数据结构与算法页面

- [数组](https://algo.illegalscreed.cn/docs/array/): 数组交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [链表](https://algo.illegalscreed.cn/docs/link/): 链表交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [栈](https://algo.illegalscreed.cn/docs/stack/): 栈交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [队列](https://algo.illegalscreed.cn/docs/queue/): 队列交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [树](https://algo.illegalscreed.cn/docs/tree/): 树交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [堆](https://algo.illegalscreed.cn/docs/heap/): 堆交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [哈希表](https://algo.illegalscreed.cn/docs/hash/): 哈希表交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [图](https://algo.illegalscreed.cn/docs/graph/): 图交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [字典树](https://algo.illegalscreed.cn/docs/trie/): 字典树交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [并查集](https://algo.illegalscreed.cn/docs/union-find/): 并查集交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [LRU 缓存](https://algo.illegalscreed.cn/docs/lru/): LRU 缓存交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [跳表](https://algo.illegalscreed.cn/docs/skip-list/): 跳表交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [线段树](https://algo.illegalscreed.cn/docs/segment-tree/): 线段树交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [B+ 树](https://algo.illegalscreed.cn/docs/b-tree/): B+ 树交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [布隆过滤器](https://algo.illegalscreed.cn/docs/bloom-filter/): 布隆过滤器交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [树状数组](https://algo.illegalscreed.cn/docs/fenwick/): 树状数组交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [冒泡排序](https://algo.illegalscreed.cn/docs/bubble-sort/): 冒泡排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [鸡尾酒排序](https://algo.illegalscreed.cn/docs/cocktail-sort/): 鸡尾酒排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [双调排序](https://algo.illegalscreed.cn/docs/bitonic-sort/): 双调排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [选择排序](https://algo.illegalscreed.cn/docs/selection-sort/): 选择排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [插入排序](https://algo.illegalscreed.cn/docs/insertion-sort/): 插入排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [二分插入排序](https://algo.illegalscreed.cn/docs/binary-insertion-sort/): 二分插入排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [希尔排序](https://algo.illegalscreed.cn/docs/shell-sort/): 希尔排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [归并排序](https://algo.illegalscreed.cn/docs/merge-sort/): 归并排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [自顶向下归并](https://algo.illegalscreed.cn/docs/top-down-merge-sort/): 自顶向下归并交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [快速排序](https://algo.illegalscreed.cn/docs/quick-sort/): 快速排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [三路快排](https://algo.illegalscreed.cn/docs/three-way-quick-sort/): 三路快排交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [双轴快排](https://algo.illegalscreed.cn/docs/dual-pivot-quick-sort/): 双轴快排交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [堆排序](https://algo.illegalscreed.cn/docs/heap-sort/): 堆排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [计数排序](https://algo.illegalscreed.cn/docs/counting-sort/): 计数排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [基数排序](https://algo.illegalscreed.cn/docs/radix-sort/): 基数排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [桶排序](https://algo.illegalscreed.cn/docs/bucket-sort/): 桶排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Dijkstra 最短路](https://algo.illegalscreed.cn/docs/dijkstra/): Dijkstra 最短路交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Kruskal 最小生成树](https://algo.illegalscreed.cn/docs/kruskal/): Kruskal 最小生成树交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Prim 最小生成树](https://algo.illegalscreed.cn/docs/prim/): Prim 最小生成树交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Bellman-Ford 最短路](https://algo.illegalscreed.cn/docs/bellman-ford/): Bellman-Ford 最短路交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [拓扑排序](https://algo.illegalscreed.cn/docs/topological-sort/): 拓扑排序交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Floyd 多源最短路](https://algo.illegalscreed.cn/docs/floyd-warshall/): Floyd 多源最短路交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [强连通分量](https://algo.illegalscreed.cn/docs/scc/): 强连通分量交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [2-SAT](https://algo.illegalscreed.cn/docs/two-sat/): 2-SAT交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [最大流](https://algo.illegalscreed.cn/docs/max-flow/): 最大流交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [二分图匹配](https://algo.illegalscreed.cn/docs/hungarian/): 二分图匹配交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [LCA 倍增](https://algo.illegalscreed.cn/docs/lca/): LCA 倍增交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [欧拉路径](https://algo.illegalscreed.cn/docs/euler-path/): 欧拉路径交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [编辑距离](https://algo.illegalscreed.cn/docs/edit-distance/): 编辑距离交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [0-1 背包](https://algo.illegalscreed.cn/docs/knapsack/): 0-1 背包交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [完全背包](https://algo.illegalscreed.cn/docs/complete-knapsack/): 完全背包交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [最长公共子序列](https://algo.illegalscreed.cn/docs/lcs/): 最长公共子序列交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [最长递增子序列](https://algo.illegalscreed.cn/docs/lis/): 最长递增子序列交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [硬币找零方案数](https://algo.illegalscreed.cn/docs/coin-change/): 硬币找零方案数交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [石子合并](https://algo.illegalscreed.cn/docs/stone-merge/): 石子合并交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [旅行商 TSP](https://algo.illegalscreed.cn/docs/tsp/): 旅行商 TSP交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [树形 DP](https://algo.illegalscreed.cn/docs/tree-dp/): 树形 DP交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [数位 DP](https://algo.illegalscreed.cn/docs/digit-dp/): 数位 DP交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [换根 DP](https://algo.illegalscreed.cn/docs/reroot-dp/): 换根 DP交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [N 皇后](https://algo.illegalscreed.cn/docs/n-queens/): N 皇后交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [子集生成](https://algo.illegalscreed.cn/docs/subsets/): 子集生成交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [全排列](https://algo.illegalscreed.cn/docs/permutations/): 全排列交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [组合总和](https://algo.illegalscreed.cn/docs/combination-sum/): 组合总和交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [迷宫寻路](https://algo.illegalscreed.cn/docs/maze/): 迷宫寻路交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [岛屿数量](https://algo.illegalscreed.cn/docs/number-of-islands/): 岛屿数量交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [单词搜索](https://algo.illegalscreed.cn/docs/word-search/): 单词搜索交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [数独](https://algo.illegalscreed.cn/docs/sudoku/): 数独交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [A* 寻路](https://algo.illegalscreed.cn/docs/astar/): A* 寻路交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [KMP 字符串匹配](https://algo.illegalscreed.cn/docs/kmp/): KMP 字符串匹配交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Rabin-Karp](https://algo.illegalscreed.cn/docs/rabin-karp/): Rabin-Karp交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Boyer-Moore](https://algo.illegalscreed.cn/docs/boyer-moore/): Boyer-Moore交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Manacher](https://algo.illegalscreed.cn/docs/manacher/): Manacher交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [后缀数组](https://algo.illegalscreed.cn/docs/suffix-array/): 后缀数组交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [LCP / height 数组](https://algo.illegalscreed.cn/docs/lcp-array/): LCP / height 数组交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [AC 自动机](https://algo.illegalscreed.cn/docs/aho-corasick/): AC 自动机交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Z 函数](https://algo.illegalscreed.cn/docs/z-function/): Z 函数交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [埃氏筛](https://algo.illegalscreed.cn/docs/sieve-of-eratosthenes/): 埃氏筛交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [线性筛](https://algo.illegalscreed.cn/docs/linear-sieve/): 线性筛交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [欧几里得算法](https://algo.illegalscreed.cn/docs/gcd/): 欧几里得算法交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [快速幂](https://algo.illegalscreed.cn/docs/fast-power/): 快速幂交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [扩展欧几里得](https://algo.illegalscreed.cn/docs/ext-gcd/): 扩展欧几里得交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [中国剩余定理](https://algo.illegalscreed.cn/docs/crt/): 中国剩余定理交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [欧拉函数](https://algo.illegalscreed.cn/docs/euler-phi/): 欧拉函数交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [米勒-拉宾](https://algo.illegalscreed.cn/docs/miller-rabin/): 米勒-拉宾交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [FFT](https://algo.illegalscreed.cn/docs/fft/): FFT交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [Pollard's Rho](https://algo.illegalscreed.cn/docs/pollard-rho/): Pollard's Rho交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [凸包](https://algo.illegalscreed.cn/docs/convex-hull/): 凸包交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [旋转卡壳](https://algo.illegalscreed.cn/docs/rotating-calipers/): 旋转卡壳交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [最近点对](https://algo.illegalscreed.cn/docs/closest-pair/): 最近点对交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [线段相交](https://algo.illegalscreed.cn/docs/segment-intersection/): 线段相交交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [扫描线求交](https://algo.illegalscreed.cn/docs/bentley-ottmann/): 扫描线求交交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [二分查找](https://algo.illegalscreed.cn/docs/binary-search/): 二分查找交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [二分边界](https://algo.illegalscreed.cn/docs/binary-bounds/): 二分边界交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [旋转数组搜索](https://algo.illegalscreed.cn/docs/rotated-search/): 旋转数组搜索交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [二分答案](https://algo.illegalscreed.cn/docs/binary-answer/): 二分答案交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。
- [三分查找](https://algo.illegalscreed.cn/docs/ternary-search/): 三分查找交互式可视化：通过逐步动画、四语言代码同步高亮和状态说明理解核心过程。

## English Catalog

- [Algorithm Visualizer](https://algo.illegalscreed.cn/en/): Explore carefully translated algorithm learning pages with step-by-step animation, synchronized code, complexity references, and guided learning paths.
- [Algorithm Complexity Reference](https://algo.illegalscreed.cn/en/docs/complexity/): Compare the time and space complexity of every translated algorithm, with concise notes and direct links to each visualization.
- [Algorithm Learning Paths](https://algo.illegalscreed.cn/en/docs/paths/): Follow focused learning routes through the translated catalog, from search and sorting fundamentals to graphs, dynamic programming, strings, and geometry.
- [Array](https://algo.illegalscreed.cn/en/docs/array/): Explore indexed access, middle insertion and deletion, and the amortized doubling strategy behind dynamic arrays.
- [Linked List](https://algo.illegalscreed.cn/en/docs/link/): Follow next and previous references, compare traversal with constant-time rewiring, and preserve bidirectional links.
- [Stack](https://algo.illegalscreed.cn/en/docs/stack/): Push, pop, and peek through one active end while preserving last-in, first-out ordering.
- [Queue and Deque](https://algo.illegalscreed.cn/en/docs/queue/): Compare first-in, first-out processing with a double-ended queue that supports both ends.
- [Binary Search Tree](https://algo.illegalscreed.cn/en/docs/tree/): Insert, search, and traverse an ordered tree, then compare a balanced shape with a degenerate chain.
- [Binary Heap](https://algo.illegalscreed.cn/en/docs/heap/): Keep the maximum at the root while array and tree views trace every sift-up and sift-down swap.
- [Hash Table](https://algo.illegalscreed.cn/en/docs/hash/): Resolve collisions with separate chaining or linear probing and observe how load factor changes lookup work.
- [Graph](https://algo.illegalscreed.cn/en/docs/graph/): Traverse vertices and edges with a BFS queue or DFS stack and compare their frontier behavior.
- [Trie](https://algo.illegalscreed.cn/en/docs/trie/): Trace exact and prefix searches through shared character paths and reveal autocomplete candidates.
- [Disjoint Set Union](https://algo.illegalscreed.cn/en/docs/union-find/): Unite components, find representative roots, and watch path compression flatten parent forests.
- [LRU Cache](https://algo.illegalscreed.cn/en/docs/lru/): Combine a hash table and doubly linked list to update recency and evict the least recently used key.
- [Skip List](https://algo.illegalscreed.cn/en/docs/skip-list/): Search a randomized hierarchy of linked express lanes by moving right and descending level by level.
- [Segment Tree](https://algo.illegalscreed.cn/en/docs/segment-tree/): Decompose range sums into complete segments and propagate a point update from leaf to root.
- [B+ Tree](https://algo.illegalscreed.cn/en/docs/b-tree/): Descend through wide index nodes for exact lookup, then follow linked leaves for a range scan.
- [Bloom Filter](https://algo.illegalscreed.cn/en/docs/bloom-filter/): Set and probe several hash-selected bits to distinguish definite absence from possible membership.
- [Fenwick Tree](https://algo.illegalscreed.cn/en/docs/fenwick/): Visualize lowbit jumps for prefix queries and point updates in a Fenwick Tree, with every affected range and tree value shown step by step.
- [Bubble Sort](https://algo.illegalscreed.cn/en/docs/bubble-sort/): Watch adjacent comparisons move the largest remaining value to the sorted suffix on every Bubble Sort pass.
- [Cocktail Shaker Sort](https://algo.illegalscreed.cn/en/docs/cocktail-sort/): Alternate forward and backward Bubble Sort passes so both large and small misplaced values move quickly.
- [Bitonic Sort](https://algo.illegalscreed.cn/en/docs/bitonic-sort/): Build bitonic sequences and merge them through a fixed comparison network whose columns can run in parallel.
- [Selection Sort](https://algo.illegalscreed.cn/en/docs/selection-sort/): Scan the unsorted suffix for its minimum and place exactly one value on every outer pass.
- [Insertion Sort](https://algo.illegalscreed.cn/en/docs/insertion-sort/): Grow a sorted prefix by shifting larger values right and inserting each key into its final local position.
- [Binary Insertion Sort](https://algo.illegalscreed.cn/en/docs/binary-insertion-sort/): Use binary search inside the sorted prefix to locate an insertion point before shifting values into place.
- [Shell Sort](https://algo.illegalscreed.cn/en/docs/shell-sort/): Run insertion sort over shrinking gaps so distant inversions disappear before the final adjacent pass.
- [Merge Sort](https://algo.illegalscreed.cn/en/docs/merge-sort/): Follow bottom-up Merge Sort as adjacent sorted runs are merged through an auxiliary array and copied back.
- [Top-Down Merge Sort](https://algo.illegalscreed.cn/en/docs/top-down-merge-sort/): Split recursively to single values, then merge sorted halves while the call stack exposes divide and conquer.
- [Quick Sort](https://algo.illegalscreed.cn/en/docs/quick-sort/): Watch Lomuto partitioning place each pivot, inspect the explicit interval stack, change the input, and follow Quick Sort code in four languages.
- [Three-Way Quick Sort](https://algo.illegalscreed.cn/en/docs/three-way-quick-sort/): Partition values into less-than, equal-to, and greater-than regions so duplicate pivots finish together.
- [Dual-Pivot Quick Sort](https://algo.illegalscreed.cn/en/docs/dual-pivot-quick-sort/): Choose two pivots and partition one interval into three regions during a single scan.
- [Heap Sort](https://algo.illegalscreed.cn/en/docs/heap-sort/): Build a max heap, extract its root into the sorted suffix, and watch array and tree views stay synchronized.
- [Counting Sort](https://algo.illegalscreed.cn/en/docs/counting-sort/): Count a compact integer value range into buckets, then write values back in order without comparing elements.
- [Radix Sort](https://algo.illegalscreed.cn/en/docs/radix-sort/): Distribute values by one digit at a time and collect buckets stably from least to most significant digit.
- [Bucket Sort](https://algo.illegalscreed.cn/en/docs/bucket-sort/): Scatter values across numeric ranges, sort each bucket independently, and concatenate the ranges in order.
- [Dijkstra's Shortest Path](https://algo.illegalscreed.cn/en/docs/dijkstra/): Trace Dijkstra's algorithm as it settles the nearest vertex, relaxes weighted edges, and builds a shortest-path tree on a directed graph.
- [Kruskal's Minimum Spanning Tree](https://algo.illegalscreed.cn/en/docs/kruskal/): Process weighted edges from lightest to heaviest, use disjoint sets to reject cycles, and watch Kruskal build a minimum spanning tree.
- [Prim's Minimum Spanning Tree](https://algo.illegalscreed.cn/en/docs/prim/): Grow one connected tree from a starting vertex by repeatedly taking the lightest edge that crosses from the tree to an outside vertex.
- [Bellman-Ford Shortest Paths](https://algo.illegalscreed.cn/en/docs/bellman-ford/): Relax every directed edge for V-1 rounds, follow distances through negative edges, and reveal the final shortest-path tree.
- [Topological Sort](https://algo.illegalscreed.cn/en/docs/topological-sort/): Run Kahn's algorithm on a directed acyclic graph, remove zero-indegree vertices, and watch each dependency update the final order.
- [Floyd-Warshall](https://algo.illegalscreed.cn/en/docs/floyd-warshall/): Update an all-pairs distance matrix by allowing one additional intermediate vertex per round.
- [Strongly Connected Components](https://algo.illegalscreed.cn/en/docs/scc/): Trace Tarjan discovery and low-link values as one DFS stack emits maximal mutually reachable components.
- [2-SAT](https://algo.illegalscreed.cn/en/docs/two-sat/): Convert two-literal clauses into implications, group them by SCC, and derive a satisfying assignment.
- [Maximum Flow](https://algo.illegalscreed.cn/en/docs/max-flow/): Find augmenting paths in a residual network, push each bottleneck, and use reverse edges to reroute flow.
- [Bipartite Matching](https://algo.illegalscreed.cn/en/docs/hungarian/): Use augmenting paths to reassign occupied partners and increase a bipartite matching one edge at a time.
- [Lowest Common Ancestor](https://algo.illegalscreed.cn/en/docs/lca/): Build binary-lifting ancestors, align node depths, and jump together to find their deepest shared ancestor.
- [Eulerian Path](https://algo.illegalscreed.cn/en/docs/euler-path/): Run Hierholzer stack traversal, consume every edge once, and append vertices while dead ends unwind.
- [Edit Distance](https://algo.illegalscreed.cn/en/docs/edit-distance/): Fill the Levenshtein dynamic-programming matrix to find the minimum insertions, deletions, and substitutions between two strings.
- [0/1 Knapsack](https://algo.illegalscreed.cn/en/docs/knapsack/): Fill the 0/1 Knapsack dynamic-programming table cell by cell and compare the skip and take choices that produce the optimal value.
- [Unbounded Knapsack](https://algo.illegalscreed.cn/en/docs/complete-knapsack/): Fill capacities while allowing each item to be chosen repeatedly, exposing the loop-order difference from 0/1 Knapsack.
- [Longest Common Subsequence](https://algo.illegalscreed.cn/en/docs/lcs/): Build the LCS table from matching and mismatching character pairs, then trace backward to reconstruct an actual common subsequence.
- [Longest Increasing Subsequence](https://algo.illegalscreed.cn/en/docs/lis/): Use one-dimensional dynamic programming to extend increasing subsequences, preserve predecessors, and reconstruct one longest result.
- [Coin Change](https://algo.illegalscreed.cn/en/docs/coin-change/): Build the minimum number of reusable coins for every amount and reconstruct one optimal combination.
- [Stone Merging](https://algo.illegalscreed.cn/en/docs/stone-merge/): Fill an interval-DP triangle by trying every final split and adding the sum of the merged interval.
- [Traveling Salesperson DP](https://algo.illegalscreed.cn/en/docs/tsp/): Use a bitmask for visited cities and end-position states to assemble the shortest Hamiltonian tour.
- [Tree Dynamic Programming](https://algo.illegalscreed.cn/en/docs/tree-dp/): Process nodes postorder and combine selected versus unselected child states for maximum independent set.
- [Digit DP](https://algo.illegalscreed.cn/en/docs/digit-dp/): Count valid numbers by scanning upper-bound digits with tight and free suffix states.
- [Rerooting DP](https://algo.illegalscreed.cn/en/docs/reroot-dp/): Compute subtree answers bottom-up, then transfer the whole-tree answer across every edge in a second pass.
- [N-Queens](https://algo.illegalscreed.cn/en/docs/n-queens/): Place queens column by column, reject attacked squares, and watch recursive backtracking recover from choices that block the board.
- [Subsets](https://algo.illegalscreed.cn/en/docs/subsets/): Traverse an include-or-exclude decision tree depth first and record every leaf to generate the complete power set without duplicates.
- [Permutations](https://algo.illegalscreed.cn/en/docs/permutations/): Choose one unused value per depth, record complete arrangements, and undo choices while exploring the decision tree.
- [Combination Sum](https://algo.illegalscreed.cn/en/docs/combination-sum/): Choose reusable candidates in nondecreasing order, prune sums above the target, and avoid duplicate combinations.
- [Maze Solving with DFS](https://algo.illegalscreed.cn/en/docs/maze/): Explore a grid depth first, mark visited cells, retreat from dead ends, and watch backtracking preserve the final path to the goal.
- [Number of Islands](https://algo.illegalscreed.cn/en/docs/number-of-islands/): Flood-fill each unseen land component and count how many independent searches begin.
- [Word Search](https://algo.illegalscreed.cn/en/docs/word-search/): Backtrack through adjacent grid cells, match one character per depth, and restore visited cells after failure.
- [Sudoku Solver](https://algo.illegalscreed.cn/en/docs/sudoku/): Try legal digits in an empty cell, propagate row-column-box constraints, and backtrack from contradictions.
- [A* Search](https://algo.illegalscreed.cn/en/docs/astar/): Order frontier cells by path cost plus heuristic and reconstruct an optimal route when the goal is settled.
- [KMP String Matching](https://algo.illegalscreed.cn/en/docs/kmp/): Follow KMP character comparisons and LPS jumps to see why the text pointer never moves backward and matching stays linear.
- [Rabin-Karp String Matching](https://algo.illegalscreed.cn/en/docs/rabin-karp/): Slide a rolling-hash window across the text, skip unequal hashes in constant time, and verify characters only after a hash match.
- [Boyer-Moore String Matching](https://algo.illegalscreed.cn/en/docs/boyer-moore/): Compare pattern characters right to left and shift by bad-character and good-suffix information after a mismatch.
- [Manacher's Longest Palindromic Substring](https://algo.illegalscreed.cn/en/docs/manacher/): Transform odd and even palindromes into one form, reuse mirror radii inside the rightmost box, and find the longest palindrome in linear time.
- [Suffix Array](https://algo.illegalscreed.cn/en/docs/suffix-array/): Rank suffixes by doubling prefix lengths until their lexicographic order becomes unique.
- [LCP Array](https://algo.illegalscreed.cn/en/docs/lcp-array/): Use inverse suffix ranks and Kasai reuse to compute adjacent longest common prefixes in linear time.
- [Aho-Corasick Automaton](https://algo.illegalscreed.cn/en/docs/aho-corasick/): Build a trie of patterns, add failure links by BFS, and report overlapping matches during one text scan.
- [Z Function](https://algo.illegalscreed.cn/en/docs/z-function/): Reuse a rightmost prefix-matching box to compute every suffix-prefix match length in linear time.
- [Sieve of Eratosthenes](https://algo.illegalscreed.cn/en/docs/sieve-of-eratosthenes/): Mark composite multiples from each prime square, stop after the square-root boundary, and reveal every prime in a numeric range.
- [Linear Sieve](https://algo.illegalscreed.cn/en/docs/linear-sieve/): Generate primes while marking each composite exactly once by its smallest prime factor.
- [Euclidean Algorithm](https://algo.illegalscreed.cn/en/docs/gcd/): Apply repeated remainders to compute a greatest common divisor while a matching square tiling gives the recurrence a geometric meaning.
- [Binary Exponentiation](https://algo.illegalscreed.cn/en/docs/fast-power/): Read exponent bits, square the base each round, and multiply only when the current bit is set.
- [Extended Euclidean Algorithm](https://algo.illegalscreed.cn/en/docs/ext-gcd/): Propagate Euclidean remainders backward to find coefficients satisfying ax + by = gcd(a, b).
- [Chinese Remainder Theorem](https://algo.illegalscreed.cn/en/docs/crt/): Merge modular congruences with inverses to reconstruct the unique solution modulo the product.
- [Euler's Totient Function](https://algo.illegalscreed.cn/en/docs/euler-phi/): Factor an integer and apply the multiplicative product formula to count smaller coprime values.
- [Miller-Rabin Primality Test](https://algo.illegalscreed.cn/en/docs/miller-rabin/): Decompose n-1 into an odd part and powers of two, then test modular witnesses for compositeness.
- [Fast Fourier Transform](https://algo.illegalscreed.cn/en/docs/fft/): Bit-reverse the input and run logarithmic layers of butterfly operations for a fast discrete Fourier transform.
- [Pollard's Rho Factorization](https://algo.illegalscreed.cn/en/docs/pollard-rho/): Race two iterates through a modular pseudo-random sequence until a gcd reveals a nontrivial factor.
- [Convex Hull](https://algo.illegalscreed.cn/en/docs/convex-hull/): Build lower and upper hulls with Andrew's monotone chain, using cross products to remove right turns and reveal the final convex polygon.
- [Rotating Calipers](https://algo.illegalscreed.cn/en/docs/rotating-calipers/): Advance antipodal support lines around a convex polygon to find its diameter without checking every pair.
- [Closest Pair of Points](https://algo.illegalscreed.cn/en/docs/closest-pair/): Divide a planar point set at its median x-coordinate, solve both halves, and inspect a narrow strip for a closer cross-boundary pair.
- [Line Segment Intersection](https://algo.illegalscreed.cn/en/docs/segment-intersection/): Use orientation cross products and bounding checks to classify proper, endpoint, collinear, and disjoint cases.
- [Bentley-Ottmann Sweep Line](https://algo.illegalscreed.cn/en/docs/bentley-ottmann/): Process endpoint and crossing events while a balanced status order tests only neighboring segments.
- [Binary Search](https://algo.illegalscreed.cn/en/docs/binary-search/): See Binary Search discard half of a sorted array at every probe, including both a successful lookup and a clean not-found result.
- [Lower and Upper Bound](https://algo.illegalscreed.cn/en/docs/binary-bounds/): Use half-open Binary Search templates to find the first value at least a target and the first value greater than it.
- [Search in a Rotated Sorted Array](https://algo.illegalscreed.cn/en/docs/rotated-search/): Identify the sorted half at each binary-search probe and keep the half that can contain the target.
- [Binary Search on the Answer](https://algo.illegalscreed.cn/en/docs/binary-answer/): Turn an optimization problem into a monotone feasibility predicate and search the numeric answer range.
- [Ternary Search](https://algo.illegalscreed.cn/en/docs/ternary-search/): Compare two interior probes and discard one third of a unimodal search interval each round.
