更改
→点度中心性
当连边与友谊或者合作相关时，指向的度中心常被解释为赶潮流，指出被解释为交际。对于有<math>|V|</math>个节点<math>|E|</math>条边的图<math>G:=(V,E)</math>，节点<math>v</math>的度中心定义为，
当连边与友谊或者合作相关时，指向的度中心常被解释为赶潮流，指出被解释为交际。对于有<math>|V|</math>个节点<math>|E|</math>条边的图<math>G:=(V,E)</math>，节点<math>v</math>的度中心定义为，
:<math>C_D(v)= \deg(v)</math>
:<math>C_{D(v)}= \deg(v)</math>
Calculating degree centrality for all the nodes in a graph takes [[big theta|<math>\Theta(V^2)</math>]] in a [[dense matrix|dense]] [[adjacency matrix]] representation of the graph, and for edges takes <math>\Theta(E)</math> in a [[sparse matrix]] representation.
Calculating degree centrality for all the nodes in a graph takes [[big theta|<math>\Theta(V^2)</math>]] in a [[dense matrix|dense]] [[adjacency matrix]] representation of the graph, and for edges takes <math>\Theta(E)</math> in a [[sparse matrix]] representation.