InterviewSolution
Saved Bookmarks
| 1. |
Consider the following statements about Bellman ford algorithm for finding shortest path in a directed connected graph G having integral edge weights.Statement I: It will always find out negative edge weight cycle in G reachable from source.Statement II: It will always give correct answer for the graph G.Choose from the options given below.(A) Both statements are true(B) Both statements are false(C) Statement I is true and Statement II is false(D) Statement II is true and Statement I is false |
| Answer» | |