Given a directed graph G = (V, E) represented as by an incidence matrix, derive the incidence matrix of the transitive closure G* of G. In G* there is an edge from vi to v; if and only if in G there is a directed path from vi to vj. In class we have seen the Floyd-Warshal algorithm to find shortest-paths from all to all. Show how to use that algorithm to produce the incidence matrix of G* from G. The rational we have seen of the FW algorithm use the operation of plus, and min. How can you replace these operations to get the FW algorithm to produce the transitive closure. Given a directed graph G = (V, E) represented as by an incidence matrix, derive the incidence matrix of the transitive closure G* of G. In G* there is an edge from vi to v; if and only if in G there is a directed path from vi to vj. In class we have seen the Floyd-Warshal algorithm to find shortest-paths from all to all. Show how to use that algorithm to produce the incidence matrix of G* from G. The rational we have seen of the FW algorithm use the operation of plus, and min. How can you replace these operations to get the FW algorithm to produce the transitive closure