Multi Choice Type QuestionFloyd Warshall Algorithm can be used for finding _____________Note: This kind of question will be helpful in clearing HCL recruitment.Marks : 1Negative Marks : 0Answer hereSingle source shortest pathTopological sortMinimum spanning treeTransitive closure

Multi Choice Type QuestionWhat approach is being followed in Floyd Warshall Algorithm?Marks : 1Negative Marks : 0Answer hereGreedy techniqueDynamic ProgrammingLinear ProgrammingBacktracking

Multi Choice Type QuestionAn all-pairs shortest-paths problem is efficiently solved using:Note: This question was asked in UGC NET 2015.Marks : 1Negative Marks : 0Answer hereDijkstra's algorithmBellman-Ford algorithmKruskal algorithmFloyd-Warshall algorithm

The Warshall algorithm uses ____ nested loops to compute the transitive closure.

Kruskal’s algorithm is used to ______Select one:a.find minimum spanning treeb.find single source shortest pathc.find all pair shortest path algorithmd.traverse the graph

Which algorithm is commonly used to find the minimum spanning tree of a weighted graph?ADijkstra's AlgorithmBKruskal's AlgorithmCBellman-Ford AlgorithmDFloyd-Warshall Algorithm