Question: The adjacency matrix below defines a directed graph with vertices A, B, C, D, E, F, G, H. 1. Write down the strong connected
The adjacency matrix below defines a directed graph with vertices A, B, C, D, E, F, G, H. 1. Write down the strong connected components as sets of vertices separated by commas and enclosed by braces. 2. Give an example of one edge we can add to make it a strong connected graph. Hint: we recommend drawing the graph on your scrap paper. 0 1 0 0 0 0 0 000 0 0 0 10000001 00001101 0 0 0 1 0 0 0 0 000 1000 00010000 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0
Step by Step Solution
3.39 Rating (152 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
