Chapter 2 - Graph Theory

Consider the undirected graph above, representing an interaction network. 

Analyze: (i) the shortest path between nodes C and J; (ii) whether edge E–F is a bridge; (iii) the clustering coefficient of node B.

Select the correct alternative bellow:

A - $d(C,J)=4$; E–F is a bridge; $C_B = 5/6$
B - $d(C,J)=5$; E–F is a bridge; $C_B = 1/2$
C - $d(C,J)=4$; E–F is not a bridge; $C_B = 2/3$
D - $d(C,J)=3$; E–F is a bridge; $C_B = 5/6$
E - None of the above

Original idea by: Matteus Vargas Simão