Найти путь к конечной вершине графа

g = Graph(9)
 
    g.add_edge(0, 1, 7)
    g.add_edge(0, 3, 8)
    g.add_edge(1, 2, 20)
    g.add_edge(1, 4, 9)
    g.add_edge(2, 5, 6)
    g.add_edge(3, 4, 10)
    g.add_edge(3, 6, 5)
    g.add_edge(4, 5, 1)
    g.add_edge(4, 7, 5)
    g.add_edge(5, 8, 12)
    g.add_edge(6, 7, 1)
    g.add_edge(7, 8, 3)
g.bellman-ford(0)

class GraphDynamic:
 
 
 
    def __init__(self, vertices):
 
        self.M = vertices  
 
        self.graph = []     
 
 
 
    
 
    def add_edge(self, a, b, c):
 
        self.graph.append([a, b, c])
 
 
 
 
    def print_solution(self, distance):
 
        print("Dynamic Programming Algorithm")
        print("Distance from start_vertex to end_vertex", "is", distance[len(distance) - 1])
 
    def bellman_ford(self, src):
 
 
        distance = [float("Inf")] * self.M
 
        distance[src] = 0
 
 
        for _ in range(self.M - 1):
 
            for a, b, c in self.graph:
 
                if distance[a] != float("Inf") and distance[a] + c < distance[b]:
 
                    distance[b] = distance[a] + c
 
        for a, b, c in self.graph:
 
            if distance[a] != float("Inf") and distance[a] + c < distance[b]:
 
                print("Graph contains negative weight cycle")
 
                return
 
 
        self.print_solution(distance)