List path $=$ new LinkedList$<>()$;

Vertex currentVertex $=$ endVertex;

while $($currentVertex $!=$ null$)\{$

path.add$(0,$ currentVertex$)$; $//$ Add to the front of the list for correct order

if $($currentVertex$.$parviousVertex $!=$ null$)\{$

Edge connectingEdge $=$ findConnectingEdge$($ currentVertex.parviousVertex,currentVertex$)$; $//$ Find the edge

totalDistance $+=$ connectingEdge.cost;

$\}$

currentVertex $=$ currentVertex.parviousVertex;

$//$ If the previous is not null.. then OK return to it

$//$ else exit from the loop

$//$ on both side: currentVertex $=$ currentVertex.parviousVertex;

$\}$ Invalid in many case, sometimes give me total distance $=0\mathrm{.}0,$ Modify it