Approach

Algorithm

Source Node: Define the source node from which the shortest distances to every other node will be calculated.
Priority Queue: Define a priority queue that contains pairs of {dist, node}, where 'dist' is the shortest distance from the source to the node.
Dist Array: Initialize a dist array with a large integer value indicating that the nodes are initially unvisited. This array stores the shortest distances to all nodes from the source.
Parent Array: This array stores the parent of each node, representing where the node came from while traversing the graph using Dijkstra’s Algorithm.

Initialize the adjacency list to store adjacent nodes and their associated weights.
Define the dist array, priority queue, and source node as part of the initial configuration.
Declare a parent array, where initially, each node is its own parent to indicate that the traversal hasn't started yet.
For each node at the top of the priority queue, pop it and check its adjacent nodes.
If the current distance is better than the previous distance (i.e., dis + edW < dist[adjNode]), update the distance and push the node into the queue.
Since we are using a min-heap, nodes with a lower distance are at the top of the priority queue.
Update the parent array with the node from where the current node came.
Repeat the steps until the priority queue is empty. At this point, we will have the minimum distance for each node, and the parent array will reflect the shortest paths.

Start from the destination node and trace back through its parent until the parent[node] equals the node itself.
Reverse the path array, as it was generated in reverse order.
Return the final 'path' array.