Sunday 29 November 2015

Q31,P3,J15. An all pair shortest paths problem is efficiently solved using.

A) Dijkstra algorithm.          B)Bellman ford algorithm    C)Kruskal algorithm   D)Floyd Warshal algorithm.
Answer D.
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)