Topology sort for course scheduling
Roadmap
- Get data from website
- Create graph data structure
- Create algorithm for topology
- Bonus points
File Structure
- Graph.java: stores directed graph data structure
- ClassScheduler.java: can perform topology sort to output graduation plan
- Main.java: contains project driver -> Creates Graph from courses.txt and prints algorithms
- web_scraper.py: parses html of course catalog with Beautiful soup and pipes data to courses.txt
- courses.txt: stores output from web_scraper.py
Roles
Devin
- Graph.java
Brian
- ClassScheduler.java
Shaun
- Video
Shared
- Bonuses
Bonus
- Rewrite the algorithm with a cap of three courses per semester: find the fastest graduation path
- Build an interactive Web/GUI application to display the algorithm
- Rewrite the algorithm to fill out the CSC advising sheet: find the fastest graduation path (least amount of semesters)
Notes from meeting with Jiang
- CSC301: no prerequisites
- only consider csc courses
- Bonus 1: max three - hardest - find fastest completion of courses
- Bonus 2: click a button, displays everything, user input possible
- Bonus 3: complete csc courses to graduate the fastest - complete grading sheet
- Video: code demo, display output, explain output, show single round