Clustering Coefficient - Intro to Algorithms
0:00 - 0:02For this problem we have 6 graphs,
0:02 - 0:04and we want you to order them with a clustering coefficient
0:04 - 0:07of the red node of each graph.
0:07 - 0:11Order them from the lowest clustering coefficient to the highest clustering coefficient.
0:11 - 0:15For example, if you think f has the lowest clustering coefficient
0:15 - 0:23put that first and then maybe b, e, a, c, d.
- Clustering Coefficient - Intro to Algorithms
- Video Language:
- CS215 - Intro to Algorithms