Sir I guess there is some confusion.. What I understood from Coreman.. negative weight cycle does not mean cycle having any edge of negative weight... Secondly dist(z) should be -2 as pointed by others.
Sir, I think you are wrong at one point. At 10:40 sec of your video, you told that this graph has a negative edge-cycle. But I couldn't find any negative edge-cycle in this graph. Moreover, in the last iteration the vertex 'z' should have weight (-2), but you have written only 2 here!
""""""" Among the edges relaxed in the ith iteration, for i = 1, 2,..., k, is (vi-1, vi). By the path-relaxation property, therefore, d[v] = d[vk] = δ(s, vk) = δ(s, v)." """"""though the lecture has some mistakes .. but my biggest doubt got cleared from your example.. I understood the meaning of the line.
The instructor seems to be a Bengali, not sure though whether he is from Bangladesh or West Bengal. Anyway, there is NO NEGATIVE CYCLE in this graph, so what you're saying at 10:38 is wrong. Negative cycle means SUM of ALL the edges ON the cycle is NEGATIVE; just having a negative edge on a cycle does not make it negative cycle; the sum needs to be negative!
Sir, I have a question.use bellman ford algorithm to find the shortest path between node u and z . Same figure on ur board. Plz explain me detail sir .plz sir bcz it's my assignment question.
u are giving wrong info about negative weight cycle. negative weight cycle exists when the total weight of a cycle is a negative number. plz correct it
Sir I guess there is some confusion.. What I understood from Coreman.. negative weight cycle does not mean cycle having any edge of negative weight... Secondly dist(z) should be -2 as pointed by others.
He is right..negative edge cycle should not consider.. But negative Weight can be considered
Sir, I think you are wrong at one point. At 10:40 sec of your video, you told that this graph has a negative edge-cycle. But I couldn't find any negative edge-cycle in this graph. Moreover, in the last iteration the vertex 'z' should have weight (-2), but you have written only 2 here!
Thank you Sir.
In the 4 step (TZ) Will be -2.
Wrong or Right??
Yup. At last, Vertex 'z' should have weight (-2). Moreover, there is no negative edge cycle in this graph.
You right brother...
very helpful lecture.............thanks
In last iteration, he considered t-z edge but did not update weight of z vertex . Z vertex distance should be -2 (2-4= -2) .
Sorry ,sir third pass me z ki value -2 ayega ..I think..
..plz check after that ....
""""""" Among the edges relaxed in the ith
iteration, for i = 1, 2,..., k, is (vi-1, vi). By the path-relaxation property, therefore, d[v] = d[vk] =
δ(s, vk) = δ(s, v)." """"""though the lecture has some mistakes .. but my biggest doubt got cleared from your example.. I understood the meaning of the line.
The instructor seems to be a Bengali, not sure though whether he is from Bangladesh or West Bengal. Anyway, there is NO NEGATIVE CYCLE in this graph, so what you're saying at 10:38 is wrong. Negative cycle means SUM of ALL the edges ON the cycle is NEGATIVE; just having a negative edge on a cycle does not make it negative cycle; the sum needs to be negative!
Sir, I have a question.use bellman ford algorithm to find the shortest path between node u and z . Same figure on ur board. Plz explain me detail sir .plz sir bcz it's my assignment question.
Thank you. I enjoyed the playlist :)
u are giving wrong info about negative weight cycle. negative weight cycle exists when the total weight of a cycle is a negative number. plz correct it
That is not a negative weight cycle, sum total will be +3
THANKS G AREGAMTSU MATASU
last iteration wil be 0 2 4 -2 7 please check4
Wrong solution at last iteration I think
Explaination regarding negetive edge cycle is wrong.
Drippppp
Alguuu...rhythm. Lets tuuk about thisuu alguu...rhythm.
Just kidding.
Poda myre....nee vann padippikk....