Shortest cycle in undirected graph (unweighted)

#1

if didnt under stand the else case
in which (dist[neigh]>=dist[src])

#2

basically we are checking that the neigh is not the parent from where we are coming

#3

hi… i hope ur doubt is cleared now

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.