dijkstra's algorithm in python (show distances and path)

Question

can anybody help me on how to show the path (node) for each node? this coding shows only the distance from first node to each node.

import heapq

def calc_dis