Given the following oriented graph, which of the statement are true?
I. Removing any node affects the strong connectivity status (strongly connected or not)
II. The graph is strongly connected.
III. The length of the shortest path from A to C is 4
IV. There exist exactly 4 cycles in the graph.
A. Only I
B. II and IV
C. I and II
D. only IV
E. None of the above
Original idea by: Victor Sotelo
No comments:
Post a Comment