|
Post by vsiap on Nov 22, 2014 16:03:12 GMT
a) There is no path from a to any other vertex, because both edges involving a are directed toward a. Therefore the graph is not strongly connected. However, the underlying undirected graph is clearly connected, so this graph is weakly connected.
b) There is no path from c to any other vertex, because both edges involving c are directed toward c. Therefore the graph is not strongly connected. However, the underlying undirected graph is clearly connected, so this graph is weakly connected.
c) The underlying undirected graph is clearly not connected (one component has vertices b, f, and e), so this graph is neither strongly nor weakly connected.
|
|