PLEASE HELP, PYTHON THANK YOU def add_vertex(self, vertex): if vertex not in self.__graph_dict: self.__graph_dict[vertex] = [] def add_edge(self, edge): edge = set(edge) (vertex1, vertex2) = tuple(edge) ################# # Problem 4: # Check to see if vertex1 is in the current graph dictionary ################## #DELETE AND PUT IN THE IF STATEMENTS self.__graph_dict[vertex1].append(vertex2) else: self.__graph_dict[vertex1] = [vertex2] def __generate_edges(self): edges = [] ################# # Problem 5: # Loop through all of the data in the graph dictionary and use the variable vertex for the loop'ed data ################## #DELETE AND PUT IN THE LOOP STATEMENTS for neighbour in self.__graph_dict[vertex]: if {neighbour, vertex} not in edges: edges.append({vertex, neighbour}) return edges def find_path(self, start_vertex, end_vertex, path=None): if path == None: path = [] graph = self.__graph_dict path = path + [start_vertex] ################# # Problem 6: # Check to see if the start_vertex equals the end_vertex # if so, return the path ################## #DELETE AND PUT IN THE IF STATEMENT ################# # Problem 7: # Check to see if the start_vertex is not in the graph # if so, return None ################## #DELETE AND PUT IN THE IF STATEMENT
PLEASE HELP, PYTHON THANK YOU
def add_vertex(self, vertex):
if vertex not in self.__graph_dict:
self.__graph_dict[vertex] = []
def add_edge(self, edge):
edge = set(edge)
(vertex1, vertex2) = tuple(edge)
#################
# Problem 4:
# Check to see if vertex1 is in the current graph dictionary
##################
#DELETE AND PUT IN THE IF STATEMENTS
self.__graph_dict[vertex1].append(vertex2)
else:
self.__graph_dict[vertex1] = [vertex2]
def __generate_edges(self):
edges = []
#################
# Problem 5:
# Loop through all of the data in the graph dictionary and use the variable vertex for the loop'ed data
##################
#DELETE AND PUT IN THE LOOP STATEMENTS
for neighbour in self.__graph_dict[vertex]:
if {neighbour, vertex} not in edges:
edges.append({vertex, neighbour})
return edges
def find_path(self, start_vertex, end_vertex, path=None):
if path == None:
path = []
graph = self.__graph_dict
path = path + [start_vertex]
#################
# Problem 6:
# Check to see if the start_vertex equals the end_vertex
# if so, return the path
##################
#DELETE AND PUT IN THE IF STATEMENT
#################
# Problem 7:
# Check to see if the start_vertex is not in the graph
# if so, return None
##################
#DELETE AND PUT IN THE IF STATEMENT
Step by step
Solved in 3 steps with 1 images
