Using Python object-oriented knowledge, I made the following modification to the dijkstra method:
return the distance between the nodes
distance_between_nodes = 0
for index in range(1, len(path)):
for thing in self.edges:
if thing.start == path[index - 1] and thing.end == path[index]:
distance_between_nodes += thing.cost
return distance_between_nodes
# return path
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Using Python object-oriented knowledge, I made the following modification to the dijkstra method:
return the distance between the nodes