Dijisktra's algorithm

#1

This question can be done by dijikstra’s algo too right?? as it is single source shortest path algo…

#2

hello @Shobhit_kumar
about which question u r talking

#3

minimum cost path which is in grid based dp

#4

cant comment because dijisktra is greedy algorithm .

try out on some test cases and see its working or not

#5

yes i have tried it out and it is running fine for the testcases…

#6

try to submit it on any online judges . it will give u clear idea whether it actually work or not

#7

i think the only case where it may not work is if we have negative entries in our table as well then in that case whether we might go for bellman ford algo or the dp part…

#8

yeah for negative edges it will fail.

#9

yes sir and in all other cases it will pass for sure