PrepStack Free

First-family relationship map

The Free graph projects only the first family. Cross-family relations, selection, complexity, and proof views are Pro.

DFS Components and ReachabilityOnce marked visited, a vertex belongs to the component represented by the current search and can never join a later component.BFS Connectivity TraversalEvery queued vertex is discovered and assigned to the current component but not fully expanded; an unseen vertex is not yet proven reachable from this start.Grid Flood FillEvery cell in the frontier has passed bounds and predicate checks and is already marked; expansion only considers its eligible neighbors.Topological Sort / Indegree EliminationEvery frontier vertex has zero indegree in the remaining graph; outputting u changes only the indegrees of u's direct successors.

DFS Components and Reachability → alternative_to → BFS Connectivity Traversal
DFS Components and Reachability → specializes → Grid Flood Fill
Topological Sort / Indegree Elimination → same_shape_different_operator → BFS Connectivity Traversal

Pro graph views

Pro only

Problem Similarity

Only available for Pro members

Pro only

Prerequisite Roadmap

Only available for Pro members

Pro only

Algorithm Selection

Only available for Pro members

Pro only

Constraint To Template

Only available for Pro members

Pro only

Composite Recipes

Only available for Pro members

Pro only

Contrast And Dual

Only available for Pro members

Pro only

Error To Invariant

Only available for Pro members

Pro only

Complexity Feasibility

Only available for Pro members

Pro only

Personal Mastery

Only available for Pro members

Pro only

Transfer Ladder

Only available for Pro members

Pro only

Modeling Transforms

Only available for Pro members

Pro only

Proof Obligations

Only available for Pro members

Pro only

Coverage Quality

Only available for Pro members