Turning "when do I graduate?" into a math problem — with a provable answer.
Build Your PlanFree. No account. Seven Purdue majors today — every major, eventually.
Purdue's First-Year Engineering program lets you explore before declaring — which is great, except comparing majors means digging through catalog PDFs and prerequisite chains by hand, one advising cycle at a time. I'm an FYE student who got tired of doing that math myself, so I built the tool that does it for me instead.
Each major is modeled as a dependency graph — courses as nodes, prerequisites as edges — and scheduling it is a lightweight relative of an integer program:
x[course, semester] ∈ {0, 1}
subject to prereqs(c) ⊆ completed-before(s)
Σ credits(s) ≤ cap
minimize Σ semesters
A greedy scheduler solves it by always prioritizing the courses on the longest remaining dependency chain. Then it checks its own work: every schedule is measured against a mathematical lower bound, and when the two match, the plan is proven optimal — not just plausible. Run an exact branch-and-bound search on demand, or open the whole degree as an orbitable 3D critical-path network.
IE, ME, ECE, CS, ChemE, CE, and Mechatronics — each a real course graph with its own progress tracking. More are being added.
Drag the credit cap and the whole plan re-solves instantly, checked against a combinatorial lower bound on every change.
Orbit the full dependency graph in space — critical path glowing gold, everything else fading into the background.
One link encodes your major, completed courses, and grades — a friend or advisor opens it exactly as you built it.
Plus: GPA projection, a weekly timetable with conflict detection, and one-click .ics calendar export.