Traversing the transpose

Computer Science Level 3

Take a look at the following directed graph G G

Consider the graph G T G^{T} obtained from transposing the adjacency matrix representation of G G . Which of the following is true about G T G^{T} ?

There is a path from f f to e e There is a path from d d to every other node There is a path from b b to g g There is a path from g g to f f

Thaddeus Abiy by Thaddeus Abiy , 25, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Hasmik Garyaka
Oct 13, 2017

Transposing adjacency matrix all directions are reversed. There is a path from f to g in our graph. So there is a path from g to f in transpoded graph.

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...