VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2026-06-25 02:04:04 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Correct type hints for networkx/algorithms/flow/mincost.pyi (#14395)

Browse Source
This commit is contained in:
Nate England
2025-07-11 05:33:33 -04:00
committed by GitHub
parent df3b5f3cdd
commit 126b06fc32
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
stubs/networkx/networkx/algorithms/flow/mincost.pyi
+6 -4
View File
@@ -6,14 +6,16 @@ from networkx.utils.backends import _dispatchable
__all__ = ["min_cost_flow_cost", "min_cost_flow", "cost_of_flow", "max_flow_min_cost"]
@_dispatchable
def min_cost_flow_cost(G: Graph[_Node], demand: str = "demand", capacity: str = "capacity", weight: str = "weight"): ...
def min_cost_flow_cost(
G: Graph[_Node], demand: str = "demand", capacity: str = "capacity", weight: str = "weight"
) -> int | float: ...
@_dispatchable
def min_cost_flow(
G: Graph[_Node], demand: str = "demand", capacity: str = "capacity", weight: str = "weight"
) -> tuple[int | Incomplete, dict[Incomplete, dict[Incomplete, Incomplete]]]: ...
) -> dict[Incomplete, dict[Incomplete, Incomplete]]: ...
@_dispatchable
def cost_of_flow(G: Graph[_Node], flowDict: SupportsGetItem[Incomplete, Incomplete], weight: str = "weight"): ...
def cost_of_flow(G: Graph[_Node], flowDict: SupportsGetItem[Incomplete, Incomplete], weight: str = "weight") -> int | float: ...
@_dispatchable
def max_flow_min_cost(
G: Graph[_Node], s: str, t: str, capacity: str = "capacity", weight: str = "weight"
) -> tuple[int | Incomplete, dict[Incomplete, dict[Incomplete, Incomplete]]]: ...
) -> dict[Incomplete, dict[Incomplete, Incomplete]]: ...