Applied Social Network Analysis in Python 3——Bipartite Graphs

搬砖仙女

于 2021-06-02 20:56:41 发布

阅读量426

点赞数 3

本文链接：https://blog.youkuaiyun.com/guxiaohui981209/article/details/117480871

版权

本文介绍了二分图的概念，如何用Python构建二分图，并探讨了投影图，特别是L-二分图权重投影，其边权重根据节点间共同邻居数量成比例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1. Definition

Bipartite Graphs: a graph whose nodes can be split into two sets L and R and every edge connects an node in L with a node in R .
在这里插入图片描述

2.Code in python

Build a bipartite graph:

from networkX.algorithms import bipartite
B = nx.Graph()  //No separate class for bipartite graphs
B.add_nodes_from(['A','B','C','D','E'],bipartite=0)  //label one set of nodes 0
B.add_nodes_from([1,2,3,4],bipartite=1)  //label other set of nodes 1
B.add_edges_from([('A',1),('B',1),('C',1),('C',3),('D',2),('E',3),('E',4)])

Fountions:
//Checking if a graph is bipartite

bipartite.is_bipartite(B)

最低0.47元/天解锁文章