P PATH·FINDER
Universidad de Manila — College of Computing Studies · BSIT

Automated Prerequisite & Scheduling Engine

Every prerequisite is a coordinate.

For irregular and shifter BSIT students, the curriculum isn't a straight line — it's a dependency graph. Path·Finder walks that graph with topological sorting to tell you exactly what you're cleared to take next, then runs a greedy interval scheduler to build a conflict-free term.

Completed
Eligible now
Locked

01 — Eligibility Engine

Kahn's algorithm, applied to your transcript

Click any node above, or a card below, to simulate completing a subject. Status recomputes instantly — including cascading locks if you undo a prerequisite something else depends on.

Completed
Eligible now
Locked

02 — Term Builder

Assemble next term, let the scheduler resolve conflicts

Select from what you're eligible for. The engine sorts every candidate section by earliest end time and greedily accepts the first non-overlapping option per subject — the same heuristic used for classic interval scheduling.

Unit cap
0 / 21 units
Select subjects above, then run the scheduler to see your weekly grid.

Resolution log

Nothing scheduled yet.

03 — Degree Progress

Distance to graduation, recalculated live

Estimated remaining semesters assumes an average load of 18 units per term, per the program's standard curriculum pacing.

0%Complete
0
Units completed
0
Units remaining
0
Program total
0
Est. semesters left