A directed graph with n vertices is given by its adjacency matrix $($the graph has

no edge weights$).$ We would like to decide about all pairs of vertices u and v whether there

exists a directed path from u to v$.$ Modify the Floyd$-$Warshall algo to solve this task, the

running time should remain O$($n$^3$

$).$