Virtual Labs

a: It can handle negative edges Explanation

Explanation

b: It can handle negative cycles Explanation

Explanation

c: It can handle both negative edges and negative cycles Explanation

Explanation

d: It has a lower time complexity Explanation

Explanation

a: Minimum spanning tree Explanation

Explanation

b: Single source shortest path Explanation

Explanation

c: All pair shortest path Explanation

Explanation

d: Network Flow Explanation

Explanation

a: Greedy algorithm Explanation

Explanation

b: Dynamic programming algorithm Explanation

Explanation

c: Divide and conquer algorithm Explanation

Explanation

d: Backtracking algorithm Explanation

Explanation

a: There is negative cycle 4->0->2->4 Explanation

Explanation

b: There is negative cycle 4->0->5->1->4 Explanation

Explanation

c: There is negative cycle 4->5->1->4 Explanation

Explanation

d: There are no negative cycles Explanation

Explanation

a: Top down approach Explanation

Explanation

b: Bottom up approach Explanation

Explanation

c: None of the above Explanation

Explanation

Floyd Warshall