两个相同的方法＆＃34; vertex_disjoint_paths＆＃34;和＆＃34;凝聚力＆＃34;在图书馆？

Question

我在igraph库的igraph库中存在两个相同功能的相同方法。 功能是：＆＃34; vertex_disjoint_paths＆＃34;和＆＃34;凝聚力＆＃34;对于$ k-vertex-connectivity $。 并且，类似地，＆＃34; edge_disjoint_paths＆＃34;和＆＃34;粘合＆＃34; $ k-edge-connectivity $。

Answer 1

这些只是别名：

>>> from igraph import Graph
>>> Graph.adhesion == Graph.edge_connectivity == Graph.edge_disjoint_paths
True
>>> Graph.cohesion == Graph.vertex_connectivity == Graph.vertex_disjoint_paths
True