0 votes 0 votes for directed weighted graph with edge weight non negative whether dijakstra will give correct result in every case ??? Algorithms general + – ishitasinha asked Jan 10, 2019 ishitasinha 283 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Kunal Kadian commented Jan 10, 2019 reply Follow Share Yes, Dijkstra will correctly give single source shortest path distances 0 votes 0 votes ishitasinha commented Jan 10, 2019 reply Follow Share m talking about every case.... 0 votes 0 votes Kunal Kadian commented Jan 10, 2019 reply Follow Share @ishitasinha Yeah, me too 0 votes 0 votes Please log in or register to add a comment.