Skip to content

networkx: Fix incompletes in connectivity/connectivity #14661

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 9 commits into from
Aug 31, 2025
Merged

networkx: Fix incompletes in connectivity/connectivity #14661

Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
a2230a6
networkx: Add new functions and missing hints and params in algorithm…
MeGaGiGaGon Aug 29, 2025
2481633
Fix errors in connectivity.pyi
MeGaGiGaGon Aug 29, 2025
2b34c66
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Aug 29, 2025
c01f4cf
Update correct connectivity.pyi
MeGaGiGaGon Aug 29, 2025
b23ceef
Revert changes to wrong connectivity.pyi
MeGaGiGaGon Aug 29, 2025
347cbbf
Fix int | floats in connectivity.pyi
MeGaGiGaGon Aug 29, 2025
337b18d
Add missing | None = Nones to connectivity.pyi
MeGaGiGaGon Aug 29, 2025
b912d43
Undo removing default_flow_func in connectivity.pyi
MeGaGiGaGon Aug 30, 2025
428d92f
Undo removing import in connectivity.pyi
MeGaGiGaGon Aug 30, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 18 additions & 12 deletions stubs/networkx/networkx/algorithms/connectivity/connectivity.pyi
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,3 @@
from _typeshed import Incomplete
from collections.abc import Callable, Iterable

from networkx.algorithms.flow import edmonds_karp
Expand All @@ -21,36 +20,43 @@ def local_node_connectivity(
G: Graph[_Node],
s: _Node,
t: _Node,
flow_func: Callable[..., Incomplete] | None = None,
flow_func: Callable[[DiGraph[_Node], _Node, _Node], DiGraph[_Node]] | None = None,
auxiliary: DiGraph[_Node] | None = None,
residual: DiGraph[_Node] | None = None,
cutoff: float | None = None,
): ...
) -> float: ...
@_dispatchable
def node_connectivity(
G: Graph[_Node], s: _Node | None = None, t: _Node | None = None, flow_func: Callable[..., Incomplete] | None = None
): ...
G: Graph[_Node],
s: _Node | None = None,
t: _Node | None = None,
flow_func: Callable[[DiGraph[_Node], _Node, _Node], DiGraph[_Node]] | None = None,
) -> float: ...
@_dispatchable
def average_node_connectivity(G: Graph[_Node], flow_func: Callable[..., Incomplete] | None = None) -> float: ...
def average_node_connectivity(
G: Graph[_Node], flow_func: Callable[[DiGraph[_Node], _Node, _Node], DiGraph[_Node]] | None = None
) -> float: ...
@_dispatchable
def all_pairs_node_connectivity(
G: Graph[_Node], nbunch: Iterable[Incomplete] | None = None, flow_func: Callable[..., Incomplete] | None = None
) -> dict[Incomplete, dict[Incomplete, Incomplete]]: ...
G: Graph[_Node],
nbunch: Iterable[tuple[_Node, _Node]] | None = None,
flow_func: Callable[[DiGraph[_Node], _Node, _Node], DiGraph[_Node]] | None = None,
) -> dict[_Node, dict[_Node, float]]: ...
@_dispatchable
def local_edge_connectivity(
G: Graph[_Node],
s: _Node,
t: _Node,
flow_func: Callable[..., Incomplete] | None = None,
flow_func: Callable[[DiGraph[_Node], _Node, _Node], DiGraph[_Node]] | None = None,
auxiliary: DiGraph[_Node] | None = None,
residual: DiGraph[_Node] | None = None,
cutoff: float | None = None,
): ...
) -> float: ...
@_dispatchable
def edge_connectivity(
G: Graph[_Node],
s: _Node | None = None,
t: _Node | None = None,
flow_func: Callable[..., Incomplete] | None = None,
flow_func: Callable[[DiGraph[_Node], _Node, _Node], DiGraph[_Node]] | None = None,
cutoff: float | None = None,
): ...
) -> float: ...
Loading