M
Explanation by: Mr. Dubey
floyd warshall algorithm can be applied in directed graphs. from a given directed graph, an adjacency matrix is framed and then all pair shortest path is computed by the floyd warshall algorithm.
You must be Logged in to update hint/solution
Loading Comments....
Related MCQs
Q. When was vacuum tube invented?
Q. The type of ganglion cells that enables the early detection of image movement are called
Q. In Comet, a tuple is a simple string
Q. Which prefixes are available to Oracle triggers?
Q. Which of the following is not a valid size of a Floppy Disk?
Q. Which of the following functions accepts only integers as arguments?
Q. Validation plan describes the approach ,resources and schedule used for system validation
Question analytics

Discusssion
Login to discuss.