def __init__(self, vertex_nums: [int] = [], edges_to_add: [(int, int)] = [], course_list=[]): DirectedGraph.__init__(self, vertex_nums, edges_to_add) self.disjunctionCount = 0 for i in range(len(course_list)): self.add_vertex(i, course_list[i]) for i in range(len(course_list)): destination = self.get_vertex_by_data(course_list[i]) #print("Course = {}. Destination = {}".format(course_list[i], destination.get_data())) self.add_prerequisite_list_to_graph(course_list[i].prerequisites, destination, False)
def __init__(self, vertex_nums: [int] = [], edges_to_add: [(int, int)] = []): DirectedGraph.__init__(self, vertex_nums, edges_to_add)