010-016 concern the following network of scientists. Each link represents a collaboration: 010. The diameter is the largest distance in the graph. What is the diameter of this graph? Show a breadth first-search illustrating this longest path. (5 points) What is the clustering coefficient of node C? Please show your work. (5 points) Q11. Q12. Name two edges that you would expect to form because of triadic closure Justify your answer. (4 points) 13. Explain, in your own
OR
OR