《Network Science with Python and NetworkX Quick Start Guide》导读(Chapter 2)

Code:[ZachxPKU/NetworkSciencewithPythonandNetworkXQuickStartGuide]

Chapter 2 Working with Networks in NetworkX

  • The Graph class
  • Attributes
  • Edge weights
  • The DiGRaph class
  • The MultiGraph and MultiDiGraph classes

The Graph class - undirected networks

Adding attributes to nodes and edges

本节当中有一些示例代码存在错误,具体如下:

node_colors = [
'#1f78b4' if G.nodes[v]["club"] == 0
else '#33a02c' for v in G]
nx.draw_networkx(G, karate_pos, label=True, node_color=node_color)

应该为:

node_colors = [
'#1f78b4' if G.nodes[v]["club"] == 0
else '#33a02c' for v in G]
nx.draw_networkx(G, karate_pos, label=True, node_color=node_colors)

Adding edge weights

The DiGraph class - when direction matters

本节当中有一些示例代码存在错误,具体如下:

G = nx.read_gexf("../data/knecht2008/klas12b-net-1.gexf")
student_pos = nx.spring_layout(G, k = 1.5)
nx.draw_networkx(G, pos, arrowsize = 20)

应该为:

G = nx.read_gexf("../data/knecht2008/klas12b-net-1.gexf")
student_pos = nx.spring_layout(G, k = 1.5)
nx.draw_networkx(G, student_pos, arrowsize = 20)
list(G.neighbors(0))

应该为

list(G.neighbors('0))

MultiGraph and MultiDiGraph – parallel edges

Summary

References

Code

评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值