def METHOD_NAME(self, src, dest):
    # To show the shortest path from src to dest
    # WARNING: Use it *after* calling dijkstra
    path = []
    cost = 0
    temp = dest
    # Backtracking from dest to src
    while self.par[temp] != -1:
        path.append(temp)
        if temp != src:
            for v, w in self.adjList[temp]:
                if v == self.par[temp]:
                    cost += w
                    break
        temp = self.par[temp]
    path.append(src)
    path.reverse()
    print("----Path to reach {} from {}----".format(dest, src))
    for u in path:
        print("{}".format(u), end=" ")
        if u != dest:
            print("-> ", end="")
    print("\nTotal cost of path: ", cost)