>when your professor shows you a thesis project that one of

File: 1481532987774.jpg (29KB, 480x411px) Image search: [Google]

29KB, 480x411px

>>8539975
*in one night

Fuck

TopMilkdude

>>8539975
Tell us the problem

>>8540639
Given a set of all the courses offered by a university, make an algorithm that can replace a guidance counselor by generating a complete schedule for all of undergrad such that you can graduate in the shortest amount of time possible, fulfulling all course dependencies while meeting the comstraint of non-overlapping schedules. The tl;dr of my solution was to enumerate the entire directed dependency graph and embed it in euclidean space, then find the minimum spanning tree to fulfill all the requirements from admission to graduation.

File: Yeeeahhhhhhhh.gif (573KB, 267x199px) Image search: [Google]

573KB, 267x199px

>>8540666
Fuck, that's wonderful AND BY FAR more useful than guidance counselors

File: A-boy-eating-crayons-draws-an-imaginative-scenario-around-himself-in-this-surreal-illustration-by-James-Jean.jpg (92KB, 700x961px) Image search: [Google]

92KB, 700x961px

>>8540681

>>8540666

That's somewhat bland; first reading it, I mistook it for something more interesting.

Let's also add additional constraints to the problem: how can you account for room availability, enlistment caps, and simultaneous registration of other students? How can we get the entirety of the class to graduate in as short a period of time as possible?

>>8540696
I'm not currently doing it yet, but you can account for all of those by adjusting the loss weights of the graph's edges. Currently edge lengths are only dictated by how far in the future that scheduled class is.

>>8540696
>How can we get the entirety of the class to graduate in as short a period of time as possible?

Zippering