Bidirectional breadth-first search: Examples & Code
Bidirectional breadth-first search: Expand complete BFS layers from node 0 and from the highest node on reversed edges. Weights are ignored. Explore a worked…
Explore algorithm visualizations code snippets and tutorials
Bidirectional breadth-first search: Expand complete BFS layers from node 0 and from the highest node on reversed edges. Weights are ignored. Explore a worked…
Stable marriage (Gale–Shapley): Proposers make offers in preference order; receivers retain their preferred offer. Complete strict lists produce a…
Job sequencing with deadlines: Schedule unit-duration jobs in descending profit order, always using the latest free slot before the deadline. Explore a worked…
Kasai longest common prefix array: Reuse the previous common-prefix length; LCP[0] is zero. The suffix array is prepared before the trace. Explore a worked…
Suffix array (prefix doubling): Sort suffixes by doubling the ranked prefix length. ASCII ordinal order is used. Explore a worked example, complexity and…