This program use approach of topological sorting which have concept of decrease and conquer. My implementation in this program is trying to take off few vertice who have no edge in (and don't forget to delete all edge out from vertice that has been deleted), after that my program will try solve the "new graph" (graph that has been simplified). If my program think the graph is still too complex to solve then it will repeat the procedur untill the graph simple enough.
OS: Windows 10
- Download the latest release
- Extract anywhere
- Open the folder that you have been extracted
- To assign what courses and prerequisites, go to ASSIGN_HERE.txt on test folder. Constraints of writing is the first one in line must be course, the next one must be prerequisites, don't use space, separate with commas, and end each course and prerequisites with dot
- To run the program open src folder and double click main13519007.py
Muhammad Tito Prakasa 13519007