gpt4 book ai didi

python - 如何从邻接矩阵仅针对特定节点创建网络图?

转载 作者:行者123 更新时间:2023-12-02 09:27:42 28 4
gpt4 key购买 nike

我有一个邻接矩阵 5000X5000,我想创建一个网络图。要求是用户输入节点,输出将是该特定输入节点的图形(第一和第二度)。

我已经尝试过使用 Gephi,但由于邻接矩阵很大,我无法专注于每个节点。所以我想是否可以为特定节点创建一个图(因为我只对每个节点的第一和第二度连接感兴趣,而不是超出这个范围)

Gephi 是基于 UI 的,所以我没有代码。

输入将是一个node_id,输出将是与该node_id对应的图(第一和第二度连接)

最佳答案

这是使用 networkx 的实现:

import networkx as nx
import numpy as np

# make dummy adjacency matrix
a = np.random.rand(100,100)
a = np.tril(a)
a = a>0.95

# make graph from adjaceny matrix
G = nx.from_numpy_matrix(a)


def neigh(G, node, depth):
""" given starting node, recursively find neighbours
until desired depth is reached
"""

node_list = []
if depth==0:
node_list.append(node)
else:
for neighbor in G.neighbors(node):
node_list.append(node)
node_list += neigh(G, neighbor, depth-1)
return list(set(node_list)) # intermediate conversion to set to lose duplicates.

# a bit more compressed:
def neigh_short(G, node, depth):
""" given starting node, recursively find neighbours
until desired depth is reached
"""

node_list = [node]
if depth>0:
for neighbor in G.neighbors(node)
node_list += neigh_short(G, neighbor, depth-1)
return list(set(node_list)) # intermediate conversion to set to lose duplicates.

# example:
# find all neighbours with distance 2 from node 5:
n = neigh(G, node=5, depth=2)

# extract the respective subgraph from G and store in H
H = G.subgraph(n)

关于python - 如何从邻接矩阵仅针对特定节点创建网络图?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/57734399/

28 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com