You have a mistake sir, in the first example (time: 6:35), you said that the shortest path from P to T is "7", it is not !. It is 5, from P > Q > R > U > T (1+1+1+2=5). Please check this

Can't we add 6 to all the edges so that we can deal with all positive values which would make the negative edge equal to 0 ? If it is OK – then nodes 3 and 4 would become a single node. What would this mean ?

It's really really helpful. Thanks you Sir, finally understood Bellman Ford and Dijkstra's algorithm completely with comparison. You have covered all the possible doubts that I had got while understanding, that's the best part. Thanks a lot again.

awesome

While you're checking for the shortest route I'm already in the pub on my second pint.

Isnt F in the second graph actually 7?

Extremely well described. Very good teaching skills.

awesome explanation. much better than engineering colleges.

best explanation ever !!!!

very good explanation….watched a lot of videos and finally got yours one…..thanks!!

What if the arrows on the edges are not mentioned for bellman ford algorithm for list of edges?

What to do in that situation?

You are gem

Sir your explanation was like a cutting edge . thank you so much

In bellman ford algo why have u taken d vertex first?

thanku

You have a mistake sir, in the first example (time: 6:35), you said that the shortest path from P to T is "7", it is not !. It is 5, from P > Q > R > U > T (1+1+1+2=5). Please check this

Best

What is the practical meaning for a NEGAFIVE edge ?

Can't we add 6 to all the edges so that we can deal with all positive values which would make the negative edge equal to 0 ? If it is OK – then nodes 3 and 4 would become a single node. What would this mean ?

Thanks

That was good

1+3-6 = -3π

don't point it out ,it's a simple mistake

It's really really helpful. Thanks you Sir, finally understood Bellman Ford and Dijkstra's algorithm completely with comparison. You have covered all the possible doubts that I had got while understanding, that's the best part.

Thanks a lot again.

awesome explanation.

Ans of dijkstra algorithm of this diagram with path my ans is a->b->c->d->e->f.

eeeeee