| Q. |
Bellmann ford algorithm provides solution for problems. |
| A. | all pair shortest path |
| B. | sorting |
| C. | network flow |
| D. | single source shortest path |
| Answer» D. single source shortest path | |
| Explanation: bellmann ford algorithm is used for finding solutions for single source shortest path problems. if the graph has no negative cycles that are reachable from the source then the algorithm produces the shortest paths and their weights. | |
Login to Continue
It will take less than 2 minutes