PrepWeave 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.

Pro graph views

Pro only

Problem Similarity

Pro only

Prerequisite Roadmap

Pro only

Algorithm Selection

Pro only

Constraint To Template

Pro only

Composite Recipes

Pro only

Contrast And Dual

Pro only

Error To Invariant

Pro only

Complexity Feasibility

Pro only

Personal Mastery

Pro only

Transfer Ladder

Pro only

Modeling Transforms

Pro only

Proof Obligations