社會網絡分析SNA

最短路徑: a path that starts at u and ends at v with the lowest  total link weight. 距離: the  lowest  total link weight between two nodes u and v in a graph. 網絡直徑:網絡中最長的最短路徑距離。要考慮權重  密度:指的是一個圖中各個點之間聯絡的緊密程度

>>阅读原文<<