Graph characteristics of diffusion tractography networks.
收藏数据链接：
官方服务：
资源简介：
Properties of the first principal network are given for each of the diffusion data sets analysed. The most connected vertex in each case is based on the sum of absolute weights of edges connected to the vertices, ignoring self-connections. Efficiency measures are calculated following Latora & Marchiori [41]. Unweighted versions of all measured are used, where the option exists.
创建时间：
2015-12-02
