python – 什么是吸引组件子图？

2019年8月4日 233次阅读

什么是图形的吸引组件子图？

Networkx has an algorithm for this.但我无法理解这是什么,因为：

>>> g.edges()
[(0, 1), (1, 2), (2, 3), (2, 5), (3, 4)]
>>> for l in nx.algorithms.components.attracting.attracting_component_subgraphs(g):
...     print l.edges()
...     print l.nodes()
... 
[]
[4]
[]
[5]

最佳答案 nx.algorithms.components.attracting_components的文档中提供了吸引组件的定义.

An attracting component in a directed graph is a strongly connected
component with the property that a random walker on the graph will
never leave the component, once it enters the component.

The nodes in attracting components can also be thought of as recurrent
nodes. If a random walker enters the attractor containing the node,
then the node will be visited infinitely often.

http://networkx.lanl.gov/reference/generated/networkx.algorithms.components.attracting.attracting_components.html#networkx.algorithms.components.attracting.attracting_components

因此,吸引组件子图将是引起满足该定义的子图的节点列表.

点赞