BFS SSP Snakes and ladder problem

#1

We can reach 36 in many ways. And, even if we use bfs
we will explore all the path but at the end our bfs is showing only the shortest path. How??

#2

i would suggest you to read this article

https://www.guru99.com/breadth-first-search-bfs-graph-example.html#:~:text=BFS%20algorithm%20works%20on%20a%20similar%20principle.&text=The%20algorithm%20traverses%20the%20graph,these%20nodes%20one%20by%20one.

#3

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.