graph algorithm - Dijkstra by means of Heap and pred-field

Question

I have the following task, but I have no idea how to do it?

Calculate (lexicographically) the shortest path from V1-node to the other nodes by means of Dijkstra. Please write the current Heaps and corresponding Pred-fields as well. Start with new Heap and pred-field before the ExtractMin-Call.

I got this result via Dijkstra, but how should I add it to the min-heap (tree)?

question from:https://stackoverflow.com/questions/65872672/dijkstra-by-means-of-heap-and-pred-field

Answer 1

Waitting for answers