Problem
In this problem, you are going to use graphs to implement a course scheduling algorithm. You will be given a list of classes and a list of prerequisites, you need to determine if you can complete the schedule. Your first task is to create drawing of the graph representation of the problem and how to use graph traversals to determine if all classes are reachable. Your second task is to implement the algorithm.
Remember to think about sources/sinks in the graph and the concept of a connected/reachable graph, whether or not the edges in this graph have weights, that this is a directed graph, how cycles may impact the algorithm, and draw the problem and examples out.
Steps:
A. Draw a representation of the first task in the problem with different examples (make sure one has a cycle in it) to ensure you understand the problem (i.e., don't worry about solving the second part of the assignment)
B. Create Vertex class and an Edge class:
a. The Vertex class can have multiple Edges
b. The Edge class has a weight
c. The Edge class has a single Vertex
C. Implement your solution to the problem.