📊 Design and Analysis of Algorithms
Q. Floyd Warshall Algorithm can be used for finding
  • (A) single source shortest path
  • (B) topological sort
  • (C) minimum spanning tree
  • (D) transitive closure
💬 Discuss
✅ Correct Answer: (D) transitive closure

Explanation: one of the ways to compute the transitive closure of a graph in theta(n3) time is to assign a weight of 1 to each edge of e and then run the floyd warshall algorithm.

Explanation by: Mr. Dubey
one of the ways to compute the transitive closure of a graph in theta(n3) time is to assign a weight of 1 to each edge of e and then run the floyd warshall algorithm.

💬 Discussion

Related MCQs

Q. Swap space is allocated

Q. Output of following program? #include <iostream> using namespace std; int fun(int=0, int = 0); int main() { cout << fun(5); return 0; } in

Q. Binary counter that count incrementally and decrement is called

Q. _________is not the operation that can be performed on Queue.

Q. A web cookie is a small piece of data that is

Q. Which of the following is the fastest means of memory access for CPU?

Q. The process of MBO starts with -----.

Q. In the alert protocol the first byte takes the value 1 or 2 which corresponds to _________ and _________ respectively.

Q. If the wait for graph contains a cycle :

Q. What does the Special Effect button on the formatting toolbar do?

📊 Question Analytics

👁️
232
Total Visits
📽️
2 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
92%
Success Rate