Graphs Single shortest source path

#1

my program is giving output
Node 0 Dist from src 0
Node 1 Dist from src 1
Node 2 Dist from src 2
Node 3 Dist from src 3
Node 4 Dist from src 4
Node 5 Dist from src 5

but the actual output is

Node 0 Dist from src 0
Node 1 Dist from src 1
Node 2 Dist from src 2
Node 3 Dist from src 1
Node 4 Dist from src 2
Node 5 Dist from src 3

#2

for this output you have to make an extra edge
form 0 to 3
then i will give output according to you
code is correct

if you want to ask something about this feel free to ask
i hope this helps
if yes show your response with :heart: and don’t forgot to mark doubt as resolved