L-4.12: Why does Dijkstra fail on Negative Weights?? Full Explanation with examples

0:00 - Introduction
3:09 - Case 1
5:08 - Case 2

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[toshibamansoori]

sir aapke explanations se lagta hai ki aapko ye sabhi subjects kitne achche se clear hai....aap bilkul fluent me explain krte hai even automatic sabhi doubt clear ho jate hai...doubt arise hi nahi hote aapke lecture ko dekhne k baad....

[ayeshaanwar]

Sir ji I have no words ..., .. excellent super brilliant or b sab Kuch amzing lectures from other's channels and so easy method...I can easily understand ur method

[tomerburman]

First, thank you for making videos and educating us.
Dijkstra doesn't work with negative weight edges, but I'd like to point out that Dijkstra's algorithm will find the minimal distance of A to C.
Because B would be able to relax C. there is no constraint that in order to be relaxed, C must still be in the heap. we relax every node that is in B's adjacency list --> so in C.d you'll get 2, as expected.

[anshulmishra]

Sir : 10 - 3 = 8 ;
Viewers : Sir ne bola 8 too 8 baat khatam...😎☝🏻

[surbhi_official]

last some many days, whenever you upload the lecture... I was already watching your previous lecture on any series. and I feel blessed to have you as a teacher. thank you so much, sir :)

[gaurikothekar]

thanks sir, because of u i scored 9+ cgpa

[kokilagoel]

You are really amazing sir off to ur hard work, research and dedication🙏🙏👍👍

[adhargupta]

7:42 Sir, love the way you corrected your mistake by smiling❤️☺️

[mastikiipatsala]

Sir your teaching techniques are superb

[madhusaivemulamada]

Please make videos/course on preparation for NIC scientist B

[kiranpanwar]

Sir you are awesome! love the way you teach.

[vasimshk]

yaar Djikstra's algo me new kya he, ye hi to hum bhi naturally karte he, find shortest path from a source to destination while driving..

Varun sir, your way of explaining things in simple terms and language is awesome..

[khushboosingh]

Guys request to all share as much as you can kitna acha padhte hai sir but koi support Karo guys subscribe Karao sir ke channel ko

[sbzlovers]

So basically, dijkstra works for negative weights because it updates the distance with every cycle.
It only fails when there is a negative cycle because it encounters infinite update of distance array.
But for simple directed graph with positive or negative weights dijkstra works properly.

[ਮਨਦੀਪਕੌਰ-ਹਫ]

Best teacher forever 😍 thnkuuu so much sir ana vdiaa teach krvnde tc

[shivaay]

00:06 Dijkstra algorithm behavior on negative weight edges
01:10 Dijkstra algorithm not suitable for negative weights
02:08 Negative weights impact Dijkstra algorithm
03:02 Dijkstra algorithm can handle negative weights with certain limitations.
03:56 Dijkstra fails on negative weights
04:57 Dijkstra fails on Negative Weights
05:56 Dijkstra algorithm fails on negative weights
06:56 Dijkstra fails on negative weights due to inability to differentiate between different paths.

[himanshumangoli]

@Gate Smashers example taken for understanding this concept is ❌ instead of taking directed graph we can take undirected graph. I don't think having negative weight is problem it is factual concept of algo once a node is relax it is relax that's final.

[EngineerDoEverything]

yes sir smjh me to agya pr apne 8 ko 7 thik kr ye bta diya ki wite my abhi ayya

[codendevelop]

"Subscribers bhut jruri he" this line is ❤

[dkbagdi]

then: why is Dijkstra so hard to understand
now: why is Dijkstra so easy