Https://ide.codingblocks.com/s/207191 BFS-Shortest path

#1

sir i have tried dijktras approach but 1 answer is showing wrong upon submission

#2

@Adarshrajpandey You don’t need to use dijkstra for this question. This can be solved using bfs traversal. And the time for dijkstra will be nlogn whereas for bfs it will be 0(n)

#3

https://ide.codingblocks.com/s/207493 sir

#4

i have done this using bfs but it is not passing showing tle in one and wrong ans in the other

#5

please check this code

#6

@Adarshrajpandey This is not a proper way to check visited array. unordered_map<int,bool>visited;
Initially it is empty so none of the nodes are assigned any value. Use an array for visited check.

#7

https://ide.codingblocks.com/s/207751 sir tried this many times but not running

#8

please check sir,sorry for the inconvenience caused sir

#9

but please tell the mistake as i m not able to find out

#10

@Adarshrajpandey initialise the distance of each node as infinity

#11

I have tired the as u hae told but one answer is ginving wrong!

#12

https://ide.codingblocks.com/s/207751 is the link

#13

@Adarshrajpandeysince you are very close to the answer I would leave it as a homework for you to learn and understand how the BFS works and get your code accepted yourself.

#14

thanks sir for working so hard on me!!

#15

@Adarshrajpandey No problem dude.