A constraint-based course scheduler for 7 Purdue engineering majors. Models each degree as a dependency graph, solves for the fastest path to graduation, and mathematically verifies the result against a combinatorial lower bound, so "optimal" isn't just a claim. Includes a 3D orbitable critical-path view, weekly timetable withics export, and GPA projection. No account, no framework, runs entirely in your browser.
Hi Product Hunt! I'm a First-Year Engineering student at Purdue, trying to pick a major, which meant comparing 7 different curricula by hand from catalog PDFs and prerequisite chains.
So I built a scheduler that models each major as a dependency graph and computes the fastest path to graduation. The part I'm most proud of: every schedule is checked against a combinatorial lower bound, so "optimal" means mathematically provable, not just "looks about right."
Also included: a full CPM (critical path method) analysis rendered as an orbitable 3D dependency graph, a weekly timetable with real conflict detection and .ics export, and GPA projection.
No account, no framework, runs entirely in your browser, and your data never leaves your device. Would love any feedback, especially from anyone who's dealt with degree planning themselves!