0 votes 0 votes Algorithms algorithms dijkstras-algorithm breadth-first-search + – Beyonder asked Aug 18, 2017 Beyonder 300 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Aug 18, 2017 reply Follow Share both A) and D) are false. A) is fasle because dijkstra always terminate(no matter whether graph contain -ve cycle or not), though it will not give correct shortest path in case of -ve weight cycle D) is fasle since it O(ElogV) 0 votes 0 votes Rishabh Gupta 2 commented Aug 18, 2017 reply Follow Share is A the correct answer? 0 votes 0 votes Please log in or register to add a comment.
