implementing dfs and bfs algorithm to sort college courses topologically. visualized using QuickGraph and GraphSharp.
create a file with extension .txt with the following format: (course-1), (course-prerequisite-1), (course-prerequisite-2). explanation:
- each line should be ended with a dot (.)
- each course and its prerequisites should be separated with a comma (,)
- program will sort the courses and its prerequisites topologically, creating a graph (course-prerequisite-1)->(course-1), etc
insert file with extension .txt inside /bin/debug/ and run CoursePlanner.exe by double-clicking