Return to Video

Clustering Coefficient - Intro to Algorithms

  • 0:00 - 0:02
    For this problem we have 6 graphs,
  • 0:02 - 0:04
    and we want you to order them with a clustering coefficient
  • 0:04 - 0:07
    of the red node of each graph.
  • 0:07 - 0:11
    Order them from the lowest clustering coefficient to the highest clustering coefficient.
  • 0:11 - 0:15
    For example, if you think f has the lowest clustering coefficient
  • 0:15 - 0:23
    put that first and then maybe b, e, a, c, d.
Cím:
Clustering Coefficient - Intro to Algorithms
Video Language:
English
Team:
Udacity
Projekt:
CS215 - Intro to Algorithms
Duration:
0:24
Udacity Robot edited Angol subtitles for Clustering Coefficient - Intro to Algorithms
Gundega edited Angol subtitles for Clustering Coefficient - Intro to Algorithms
Amara Bot hozzáadott egy fordítást

English subtitles

Felülvizsgálatok Compare revisions