How do i find the shortest path from v$4$ to v$6$ using Dijkstra's algorithm $($by hand$)?$ From v$4$ there are $3$ vertices that are an equal distance away so i$\text{'}$m confused how to represent that in the iterations table. Can someone write out the table of iterations? Thank you