please help with python coding: dijkstra:

Guide:

Dijkstra's algorithm finds the shortest path from a source node to all other

nodes. It uses a priority queue to select the next closest node and updates the

distances to neighboring nodes.

Pseudocode:

FUNCTION dijkstra$($graph$,$ start$)$:

$n=$ NUNBER OF NODES in graph

INITIALIZE distance list "dist" with infinite distances for all nodes and e for start

node

INITIALIZE set "unvisited" with all nodes

MHILE 'unvisited' is not erpty:

SELECT 'current' node from 'unvisited' having the smallest distance in 'dist'

RENOVE 'current' node from 'unvisited'

FOR each 'neighbor' and its 'meight' from 'graph' corresponding to 'current':

IF there is an edge $($i$.$e$.,$ non$-$zero wieght$)$ AND 'neighbor" is in "unvisited':

CDNPUTE 'new$\_$dist' as sun of distance of 'current' and 'meight'

IF 'new$\_$dist' is less than the distance of 'neighbor' in 'dist'?

LPDATE distance of 'neighbor' in 'dist' with 'new$\_$dist'

RETURN 'dist'