InterviewSolution
 Saved Bookmarks
    				| 1. | 
                                    Which of the following algorithm solves the all-pair shortest path problem?(A) Prim’s algorithm(B) Dijikstra’s algorithm(C) Bellman-Ford’s algorithm(D) Floyd-Warshall’s algorithm | 
                            
| Answer» | |