i was able to study four units in 2 days.a month ago felt like an impossible task.thanks a lot for making these videos.i am thinking of scoring rather than passing now
I don't think it's suitable, for example between V1 to all the V2 nodes, if I did dijkstra's I would only go to node 5 (distance 2) being greedy. However, it turns out that the shortest path from S to T goes through node 2/ 3 for a total distance of 16 for both. In short I would say dijkstra's would give the shortest path between nodes, but the question is whether that path is the shortest path (out of all the possible permutations) to begin with.
sir, all your lecture r full of knoledge......... but u r very confusing.............. frequently changing pages..........writing and reading at a same time............ very unplanned and confusing......... pls try to update if possible
Best video on UA-cam to understand multistage graph by D.P.
this video is very good..now i think i can score good marks in exams,,without attending college lectures..thanks sir
You are welcome Richa, I am happy that my lectures are helping u in scoring marks without attending lectures :)
saurabhschool your lctrs r soo good..even btr dan our clg teachers..keep uploading..thnks
richa mahajan
Thanks a lot Richa for such a nice comment!
+saurabhschool where can i get a Matlab code for multistage graph dynamic programming ?
+Hnin Pann Phyu Hi Hnin, I don not have a matlab code, but you can search on the Internet or can write one
Great video sir !!
i was able to study four units in 2 days.a month ago felt like an impossible task.thanks a lot for making these videos.i am thinking of scoring rather than passing now
Thats very good news. All the best for your exams. I am sure you will do well in your exams!
why starting from 3 when source is 1 and also there is no edge between 3 to 8 then how are you calculating cost(3,8)?
very well explained!!!!!!!!!! sir
Great vedio sir.....thankuu
+saurabhschool thanks a lot....this video helps a lot.....i like your way of teaching i.e slow and in simple manner....thank you...a big like(y)
sir why u taken initial computing stage from 3
Thank you so much sir, the lectures are great :D
great video
nicely explained thanks:D
Dijkstra's algorithm(Greedy) is suitable for this problem, but you said Greedy is not suitable for this problem.
I don't think it's suitable, for example between V1 to all the V2 nodes, if I did dijkstra's I would only go to node 5 (distance 2) being greedy.
However, it turns out that the shortest path from S to T goes through node 2/ 3 for a total distance of 16 for both.
In short I would say dijkstra's would give the shortest path between nodes, but the question is whether that path is the shortest path (out of all the possible permutations) to begin with.
cost(2,2) instead of c(2,2)????
Just wondering why cant we use dijkatra shortest path here.
Because it is multigraph and it can't be solved by Dijkstra method.
See if my try at the explanation helps!
thanks
thanqq
sir, all your lecture r full of knoledge.........
but u r very confusing.............. frequently changing pages..........writing and reading at a same time............
very unplanned and confusing.........
pls try to update if possible