Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified

[@anuragtiwari2511]

in last part of the video sir asked for feedback, here it is Those who are new to sir let me tell you he is a "legend", he can make even a dumber guy understand these DAA algos trust me he is such a legend.

[@mukeshmahadev7419]

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.

[@saprra1]

Sir without you my DSA =0 i was breaking my head , could nt understand anything. Thanks for making coding easy

[@prashantkamble898]

awesome explanation. much better than engineering colleges.

[@subhrenduchattopadhyay]

Complexity analysis of bellman-ford (19:35): O(V times E ) -> O(V^3) as |E| can be v*(v-1) for completely connected graph/clique.

[@prodbyjaswant551]

You are over counting. Each edge from each vertex will be connected to another vertex hence max |E| = v(v-1)/2.

[@subhrenduchattopadhyay]

@prodbyjaswant551 The complexity remains the same. O(v^3).

[@maverickchinmaydas]

Hi +Abdul Bari sir - Why we have taken d vertex first when we deal with negative vertex in bellmanford algorithm (15:38) . We could start with (a,c) (c,d)(d,b) (a,b) rather we selected (d,b) (c,d) (a,c) (a,b) . Can you please explain once again why ?

[@aishwaryaratnam154]

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

[@Antakya0001]

Abdul Bari >>>> university professors Best teacher!

[@Malik-bx6qg]

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

[@Malik-bx6qg]

Aaa, now I know. Thank you for the explanation. My comment is useful though.

[@javariamalik8475]

Where is the explanation. I'm not able to understand it ​@@Malik-bx6qg

[@neerajnishad4689]

Sir please come back to KZbin, world needs you!!!

[@MastAdmiLive]

Our teachers gave us 150slides of ppt

[@aradhyajain9575]

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

[@debarkasengupta4500]

Extremely well described. Very good teaching skills.

[@tasmiyamuazzam8972]

Sir.. lekin fr kya krenge agr negative cycle exist kregi to..

[@mayanktripathi3666]

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

[@kunalkheeva]

How are you so greatly simplifying the algorithms?? Thank you sir>>>>

[@TonyDaExpert]

I am gonna watch these videos till I master the theory well and I will buy your c++/c data structure course you are amazing

[@cse530]

Hlo bro did u buy the courses

[@TheWhiteBreadMan]

Thank you, that helped me a lot!

[@haneulkim4902]

Thanks for the video! @13:32 you say that once shortest path has been found it cannot be updated hence dijkstra algorithm sometimes fail with negative weight edges. However replacing 1-4 edge with 10 and 3-4 edge with 2, it will do the same thing as having 1-4 edge = 1 , 3-4edge = -6. Does that mean it sometimes doesn't work for positive weight edges too?

[@haneulkim4902]

@@abdul_bari But you said once vertex is relaxed it cannot be relaxed again that is why it failed with negative weights.

[@usamamohiuddin7904]

at 25:00 the cost should be -2, but thanks for the amazing video otherwise!

[@edwinthomas9174]

best explanation ever !!!!

[@asifanawaz38]

What should we do if the arrows are not mentioned in the question? How should we proceed then?

[@muezabebe5669]

your tutorial is very inteested

[@UnBoxerBHAI]

SIR THERE IS ONE REQUEST PLEASE SWITCH BACK TO TEACHING ON BOARD AS THOSE VIDEO'S WERE MORE INTRESTING THAN THIS. LOVE YOUR VIDEOS

[@IcyIndia]

Sir please recheck at 5:45 time in this video ... point T should be 5 not 7 .

[@zouhairghazi3541]

No, it shouldn't. The graph is in fact oriented so you cant travel from vertex U to vertex T.

[@TheRealBoroNut]

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

[@SamaaSeif]

when you pick edges for bellman theory, why do u put d-b first? what makes it be in that order

[@mahoorkhan630]

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

[@indra16]

amazing sir amazing💕😍

[@noyonrongon6292]

awesome explanation.

[@lilj1702]

Isnt F in the second graph actually 7?

[@rahimkorbo8158]

What if the arrows on the edges are not mentioned for bellman ford algorithm for list of edges? What to do in that situation?

[@rahimkorbo8158]

On each node?

[@spifuntastic621]

25:01 1+3 - 6 = -2

[@c.danielpremkumar8495]

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 ?

[@Amitsa299]

You are gem

[@abuibrahym1182]

Thanks That was good

[@c.danielpremkumar8495]

What is the practical meaning for a NEGAFIVE edge ?

[@Kitty-Corn-3]

Don't limit you thinking about edges just in terms of water flowing through the pipes .. or packets through the network wire .. Think of a case when you're google and sending traffic to a website when customer clicks an ad .. and the edge value is the money you charge ..

[@evelynross1043]

In real scenarios , it can represent a transaction which can be both positive and negative .

[@muhammadaltafhussain3084]

25:00 1+ 3 -6 = -2 ,

[@saurabhmittal2504]

1+3-6 = -3😊 don't point it out ,it's a simple mistake

[@aakashsharma8687]

Thank you sir

[@ahmadshirazi4757]

Perfect💯

[@shubhampathak3770]

awesome

[@shareefudin2164]

thanku

[@radnustech7762]

Best

[@gameslife9179]

Great

[@abhishek_sengupta]

Thanks a lot!

[@vineetchauhan8192]

eeeeee