更改

* Structural Analysis through “three centrality measures (degree, betweenness, and closeness) to identify central members in a given subgroup.<ref name=Xu/> CrimeNet Explorer employed [[Dijkstra's algorithm|Dijkstra’s shortest-path algorithm]] to calculate the betweenness and closeness from a single node to all other nodes in the subgroup.

* Structural Analysis through “three centrality measures (degree, betweenness, and closeness) to identify central members in a given subgroup.<ref name=Xu/> CrimeNet Explorer employed [[Dijkstra's algorithm|Dijkstra’s shortest-path algorithm]] to calculate the betweenness and closeness from a single node to all other nodes in the subgroup.

通过“三种中心性度量（度，间隔度和紧密度）来识别给定子集中的中心成员”进行结构分析。CrimeNet Explorer使用Dijkstra的最短路径算法来计算从单个节点到子组中所有其他节点的间隔度和紧密度。

通过“三种中心性度量（度，中间性和紧密性）来识别给定子集中的中心成员”进行结构分析。CrimeNet Explorer使用Dijkstra的最短路径算法来计算从单个节点到子组中所有其他节点的间隔度和紧密度。

* Network Visualization using Torgerson’s metric [[Multidimensional scaling|multidimensional scaling (MDS)]] algorithm.

* Network Visualization using Torgerson’s metric [[Multidimensional scaling|multidimensional scaling (MDS)]] algorithm.