Question Solved1 Answer Is the graph a strongly connected graph (i.e., the whole graph is a strongly connected component)? Justify your answer. If not, can we make it strongly connected by only reversing the direction of ONE edge in the graph? Justify you answer. B 1 С J D G E F H А.

01KIK9 The Asker · Computer Science

Transcribed Image Text: Is the graph a strongly connected graph (i.e., the whole graph is a strongly connected component)? Justify your answer. If not, can we make it strongly connected by only reversing the direction of ONE edge in the graph? Justify you answer. B 1 С J D G E F H А.
More
Transcribed Image Text: Is the graph a strongly connected graph (i.e., the whole graph is a strongly connected component)? Justify your answer. If not, can we make it strongly connected by only reversing the direction of ONE edge in the graph? Justify you answer. B 1 С J D G E F H А.
See Answer
Add Answer +20 Points
Community Answer
KC1RFY The First Answerer
See all the answers with 1 Unlock
Get 4 Free Unlocks by registration

A graph is said to be strongly connected graph if each vertex of that graph is reachable from every other verter.   The given graph is not strongly connected graph, because for a fraph to be stronglt connected every vertex should be reachable from every other vertex and for this every vertex should have indegree and outdegree of atleast 1. But in the given graph we can see that vertex J has indegree = 0 , so we can not reach to vertex J from any of the vertex as it does not have an incoming edge.   We can not make graph strongly connected just by reversing the direction of ONE ... See the full answer