Apply Floyd algorithm to the following graph:
Which of the following statements is false?

Question

Apply Floyd algorithm to the following graph:  
 Which of the following statements is false?

Answer

We can find shortest paths from any vertex to others in this graph.

Answer

In initial weighted matrix, distances from e to others are infinity.

Answer

abce is not shortest path from a to e.

Answer

The shortest path from vertex a to vertex e is zero.

Crowdly