|
本人有一个M*M的矩阵,如果i是j的子集取值为1,否则为0. 现在问题是想找出其中各个网络社群的根节点,即它是该社群的祖先。
请问怎么办?
id | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2.21E+09 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
数据格式为上面的样子
我知道可以使用networkx.connected_component_subgraphs()得到各个社群
但不知道怎么进一步识别根节点
|
|