0 votes 0 votes Dijktra Algo selects shortest path having maximum number of shortest edges, for non adjacent nodes. Is it true? Please justify.. Algorithms algorithms graph-algorithms + – Shamim Ahmed asked Nov 25, 2018 Shamim Ahmed 541 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments gauravkc commented Nov 25, 2018 reply Follow Share I feel it is not always the case. In this example, path should be 1-3-4-5-6 but it prints 1-2-7-6 0 votes 0 votes Shamim Ahmed commented Nov 25, 2018 reply Follow Share So the statement is essentially not true. Can we conclude.. we must access such questions based on the options given. Because even if we use algorithm to find shortest path... there are many possibilities. 0 votes 0 votes gauravkc commented Nov 25, 2018 reply Follow Share Yup. When there are choices, result depends upon how algorithm is executing each step. It's better to execute algorithm. 0 votes 0 votes Please log in or register to add a comment.