M
Explanation by: Mr. Dubey
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.
You must be Logged in to update hint/solution
Related MCQs
Q. The term synchronous means _
Q. Diffie-Hellman algorithm is widely known as
Q. an open source stack for gateways and the edge.
Q. Which model is most popular for student’s small projects?
Q. Which of the following problems can be solved using the longest subsequence problem?
Q. Which of these is not a command of Unix related with DOS
Q. It is difficult to access conventional file system than Database System.
Q. The BUS that allows I/O, memory and Processor to coexist is
Discusssion
Login to discuss.