Analyse the following graph:
Choose the true statement:
A) Both node D and node A have the same clustering coefficient.
B) Node E has the highest clustering coefficient.
C) This graph can be classified as a disconnected graph since not all nodes connect with each other.
D) Node F currently has a clustering coefficient of zero. However, if we establish a connection between node F and node A, its clustering coefficient would be the highest in the graph.
E) None of above
Original idea by: João Marcos
No comments:
Post a Comment