npm - basedpyright - Versions diffs - 1.28.3 → 1.28.4 - Mend

basedpyright 1.28.3 → 1.28.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (375) hide show

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/clique.pyi CHANGED Viewed

@@ -1,5 +1,5 @@
-from _typeshed import SupportsGetItem, Unused
-from collections.abc import Generator, Iterable, Iterator, Sized
+from _typeshed import Incomplete
+from collections.abc import Generator, Iterable, Iterator
 from typing import overload
 from networkx.classes.graph import Graph, _Node
@@ -8,23 +8,18 @@ from networkx.utils.backends import _dispatchable
 @_dispatchable
 def enumerate_all_cliques(G: Graph[_Node]) -> Generator[list[_Node], None, None]: ...
 @_dispatchable
-def find_cliques(G: Graph[_Node], nodes: SupportsGetItem[slice, _Node] | None = None) -> Generator[list[_Node], None, None]: ...
+def find_cliques(G: Graph[_Node], nodes: Iterable[Incomplete] | None = None) -> Generator[list[_Node], None, None]: ...
 @_dispatchable
-def find_cliques_recursive(G: Graph[_Node], nodes: SupportsGetItem[slice, _Node] | None = None) -> Iterator[list[_Node]]: ...
+def find_cliques_recursive(G: Graph[_Node], nodes: Iterable[Incomplete] | None = None) -> Iterator[list[_Node]]: ...
 @_dispatchable
-def make_max_clique_graph(G: Graph[_Node], create_using: type[Graph[_Node]] | None = None) -> Graph[_Node]: ...
+def make_max_clique_graph(G: Graph[_Node], create_using: Graph[_Node] | None = None) -> Graph[_Node]: ...
 @_dispatchable
 def make_clique_bipartite(
-    G: Graph[_Node], fpos: Unused = None, create_using: type[Graph[_Node]] | None = None, name: Unused = None
+    G: Graph[_Node], fpos: bool | None = None, create_using: Graph[_Node] | None = None, name=None
 ) -> Graph[_Node]: ...
 @overload
-def node_clique_number(  # type: ignore[misc]  # Incompatible return types
-    G: Graph[_Node],
-    nodes: Iterable[_Node] | None = None,
-    cliques: Iterable[Iterable[_Node]] | None = None,
-    separate_nodes: Unused = False,
+def node_clique_number(
+    G: Graph[_Node], nodes=None, cliques: Iterable[Incomplete] | None = None, separate_nodes=False
 ) -> dict[_Node, int]: ...
 @overload
-def node_clique_number(
-    G: Graph[_Node], nodes: _Node, cliques: Iterable[Sized] | None = None, separate_nodes: Unused = False
-) -> int: ...
+def node_clique_number(G: Graph[_Node], nodes=None, cliques: Iterable[Incomplete] | None = None, separate_nodes=False) -> int: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/cluster.pyi CHANGED Viewed

@@ -1,16 +1,19 @@
-from _typeshed import Incomplete
+from collections.abc import Iterable
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def triangles(G, nodes: Incomplete | None = None): ...
+def triangles(G: Graph[_Node], nodes=None): ...
 @_dispatchable
-def average_clustering(G, nodes: Incomplete | None = None, weight: Incomplete | None = None, count_zeros: bool = True): ...
+def average_clustering(
+    G: Graph[_Node], nodes: Iterable[_Node] | None = None, weight: str | None = None, count_zeros: bool = True
+): ...
 @_dispatchable
-def clustering(G, nodes: Incomplete | None = None, weight: Incomplete | None = None): ...
+def clustering(G: Graph[_Node], nodes=None, weight: str | None = None): ...
 @_dispatchable
-def transitivity(G): ...
+def transitivity(G: Graph[_Node]): ...
 @_dispatchable
-def square_clustering(G, nodes: Incomplete | None = None): ...
+def square_clustering(G: Graph[_Node], nodes: Iterable[_Node] | None = None): ...
 @_dispatchable
-def generalized_degree(G, nodes: Incomplete | None = None): ...
+def generalized_degree(G: Graph[_Node], nodes: Iterable[_Node] | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/coloring/equitable_coloring.pyi CHANGED Viewed

@@ -1,4 +1,5 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def equitable_color(G, num_colors): ...
+def equitable_color(G: Graph[_Node], num_colors): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/coloring/greedy_coloring.pyi CHANGED Viewed

@@ -1,6 +1,7 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 __all__ = [
@@ -32,23 +33,4 @@ def strategy_connected_sequential(G, colors, traversal: str = "bfs") -> Generato
 @_dispatchable
 def strategy_saturation_largest_first(G, colors) -> Generator[Incomplete, None, Incomplete]: ...
 @_dispatchable
-def greedy_color(G, strategy: str = "largest_first", interchange: bool = False): ...
-class _Node:
-    node_id: Incomplete
-    color: int
-    adj_list: Incomplete
-    adj_color: Incomplete
-    def __init__(self, node_id, n) -> None: ...
-    def assign_color(self, adj_entry, color) -> None: ...
-    def clear_color(self, adj_entry, color) -> None: ...
-    def iter_neighbors(self) -> Generator[Incomplete, None, None]: ...
-    def iter_neighbors_color(self, color) -> Generator[Incomplete, None, None]: ...
-class _AdjEntry:
-    node_id: Incomplete
-    next: Incomplete
-    mate: Incomplete
-    col_next: Incomplete
-    col_prev: Incomplete
-    def __init__(self, node_id) -> None: ...
+def greedy_color(G: Graph[_Node], strategy="largest_first", interchange: bool = False): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/communicability_alg.pyi CHANGED Viewed

@@ -1,6 +1,7 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def communicability(G): ...
+def communicability(G: Graph[_Node]): ...
 @_dispatchable
-def communicability_exp(G): ...
+def communicability_exp(G: Graph[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/asyn_fluid.pyi CHANGED Viewed

@@ -1,6 +1,6 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 @_dispatchable
-def asyn_fluidc(G, k, max_iter: int = 100, seed: Incomplete | None = None): ...
+def asyn_fluidc(G: Graph[_Node], k: int, max_iter: int = 100, seed: int | RandomState | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/centrality.pyi CHANGED Viewed

@@ -1,7 +1,10 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Callable, Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def girvan_newman(G, most_valuable_edge: Incomplete | None = None) -> Generator[Incomplete, None, Incomplete]: ...
+def girvan_newman(
+    G: Graph[_Node], most_valuable_edge: Callable[..., Incomplete] | None = None
+) -> Generator[Incomplete, None, Incomplete]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/community_utils.pyi CHANGED Viewed

@@ -1,4 +1,5 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_partition(G, communities): ...
+def is_partition(G: Graph[_Node], communities): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/divisive.pyi CHANGED Viewed

@@ -1,10 +1,13 @@
 from _typeshed import Incomplete
 import networkx as nx
+from networkx.classes.graph import Graph, _Node
 __all__ = ["edge_betweenness_partition", "edge_current_flow_betweenness_partition"]
 @nx._dispatchable
-def edge_betweenness_partition(G, number_of_sets: int, *, weight: Incomplete | None = None) -> list[Incomplete]: ...
+def edge_betweenness_partition(G: Graph[_Node], number_of_sets: int, *, weight: str | None = None) -> list[Incomplete]: ...
 @nx._dispatchable
-def edge_current_flow_betweenness_partition(G, number_of_sets: int, *, weight: Incomplete | None = None) -> list[Incomplete]: ...
+def edge_current_flow_betweenness_partition(
+    G: Graph[_Node], number_of_sets: int, *, weight: str | None = None
+) -> list[Incomplete]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/kclique.pyi CHANGED Viewed

@@ -1,7 +1,8 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def k_clique_communities(G, k, cliques: Incomplete | None = None) -> Generator[Incomplete, None, None]: ...
+def k_clique_communities(G: Graph[_Node], k: int, cliques=None) -> Generator[Incomplete, None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/kernighan_lin.pyi CHANGED Viewed

@@ -1,8 +1,14 @@
 from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 @_dispatchable
 def kernighan_lin_bisection(
-    G, partition: Incomplete | None = None, max_iter: int = 10, weight: str = "weight", seed: Incomplete | None = None
+    G: Graph[_Node],
+    partition: tuple[Incomplete] | None = None,
+    max_iter: int = 10,
+    weight: str = "weight",
+    seed: int | RandomState | None = None,
 ): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/label_propagation.pyi CHANGED Viewed

@@ -1,11 +1,13 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 @_dispatchable
 def asyn_lpa_communities(
-    G, weight: Incomplete | None = None, seed: Incomplete | None = None
+    G: Graph[_Node], weight: str | None = None, seed: int | RandomState | None = None
 ) -> Generator[Incomplete, Incomplete, None]: ...
 @_dispatchable
-def label_propagation_communities(G): ...
+def label_propagation_communities(G: Graph[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/louvain.pyi CHANGED Viewed

@@ -1,13 +1,24 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 @_dispatchable
 def louvain_communities(
-    G, weight: str = "weight", resolution: float = 1, threshold: float = 1e-07, seed: Incomplete | None = None
+    G: Graph[_Node],
+    weight: str | None = "weight",
+    resolution: float | None = 1,
+    threshold: float | None = 1e-07,
+    max_level: int | None = None,
+    seed: int | RandomState | None = None,
 ): ...
 @_dispatchable
 def louvain_partitions(
-    G, weight: str = "weight", resolution: float = 1, threshold: float = 1e-07, seed: Incomplete | None = None
+    G: Graph[_Node],
+    weight: str | None = "weight",
+    resolution: float | None = 1,
+    threshold: float | None = 1e-07,
+    seed: int | RandomState | None = None,
 ) -> Generator[Incomplete, None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/lukes.pyi CHANGED Viewed

@@ -1,6 +1,5 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def lukes_partitioning(G, max_size, node_weight: Incomplete | None = None, edge_weight: Incomplete | None = None): ...
+def lukes_partitioning(G: Graph[_Node], max_size: int, node_weight=None, edge_weight=None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/modularity_max.pyi CHANGED Viewed

@@ -1,10 +1,9 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def greedy_modularity_communities(
-    G, weight: Incomplete | None = None, resolution: float = 1, cutoff: int = 1, best_n: Incomplete | None = None
+    G: Graph[_Node], weight: str | None = None, resolution: float | None = 1, cutoff: int | None = 1, best_n: int | None = None
 ): ...
 @_dispatchable
-def naive_greedy_modularity_communities(G, resolution: float = 1, weight: Incomplete | None = None): ...
+def naive_greedy_modularity_communities(G: Graph[_Node], resolution: float = 1, weight: str | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/quality.pyi CHANGED Viewed

@@ -1,3 +1,4 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.exception import NetworkXError
 from networkx.utils.backends import _dispatchable
@@ -7,6 +8,6 @@ class NotAPartition(NetworkXError):
     def __init__(self, G, collection) -> None: ...
 @_dispatchable
-def modularity(G, communities, weight: str = "weight", resolution: float = 1): ...
+def modularity(G: Graph[_Node], communities, weight: str | None = "weight", resolution: float = 1): ...
 @_dispatchable
-def partition_quality(G, partition): ...
+def partition_quality(G: Graph[_Node], partition): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/components/biconnected.pyi CHANGED Viewed

@@ -1,13 +1,14 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_biconnected(G): ...
+def is_biconnected(G: Graph[_Node]): ...
 @_dispatchable
-def biconnected_component_edges(G) -> Generator[Incomplete, Incomplete, None]: ...
+def biconnected_component_edges(G: Graph[_Node]) -> Generator[Incomplete, Incomplete, None]: ...
 @_dispatchable
-def biconnected_components(G) -> Generator[Incomplete, None, None]: ...
+def biconnected_components(G: Graph[_Node]) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
-def articulation_points(G) -> Generator[Incomplete, None, None]: ...
+def articulation_points(G: Graph[_Node]) -> Generator[Incomplete, None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/components/connected.pyi CHANGED Viewed

@@ -1,13 +1,14 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def connected_components(G) -> Generator[Incomplete, None, None]: ...
+def connected_components(G: Graph[_Node]) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
-def number_connected_components(G): ...
+def number_connected_components(G: Graph[_Node]): ...
 @_dispatchable
-def is_connected(G): ...
+def is_connected(G: Graph[_Node]): ...
 @_dispatchable
-def node_connected_component(G, n): ...
+def node_connected_component(G: Graph[_Node], n: _Node): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/components/semiconnected.pyi CHANGED Viewed

@@ -1,6 +1,5 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_semiconnected(G, topo_order: Incomplete | None = None): ...
+def is_semiconnected(G: Graph[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/components/strongly_connected.pyi CHANGED Viewed

@@ -1,4 +1,4 @@
-from collections.abc import Generator, Hashable, Iterable
+from collections.abc import Generator
 from networkx.classes.digraph import DiGraph
 from networkx.classes.graph import Graph, _Node
@@ -7,10 +7,10 @@ from networkx.utils.backends import _dispatchable
 @_dispatchable
 def strongly_connected_components(G: Graph[_Node]) -> Generator[set[_Node], None, None]: ...
 @_dispatchable
-def kosaraju_strongly_connected_components(G: Graph[_Node], source: _Node | None = None) -> Generator[set[_Node], None, None]: ...
+def kosaraju_strongly_connected_components(G: Graph[_Node], source=None) -> Generator[set[_Node], None, None]: ...
 @_dispatchable
-def number_strongly_connected_components(G: Graph[Hashable]) -> int: ...
+def number_strongly_connected_components(G: Graph[_Node]) -> int: ...
 @_dispatchable
-def is_strongly_connected(G: Graph[Hashable]) -> bool: ...
+def is_strongly_connected(G: Graph[_Node]) -> bool: ...
 @_dispatchable
-def condensation(G: DiGraph[_Node], scc: Iterable[Iterable[_Node]] | None = None) -> DiGraph[int]: ...
+def condensation(G: DiGraph[_Node], scc=None) -> DiGraph[int]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/components/weakly_connected.pyi CHANGED Viewed

@@ -1,4 +1,4 @@
-from collections.abc import Generator, Hashable
+from collections.abc import Generator
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
@@ -6,6 +6,6 @@ from networkx.utils.backends import _dispatchable
 @_dispatchable
 def weakly_connected_components(G: Graph[_Node]) -> Generator[set[_Node], None, None]: ...
 @_dispatchable
-def number_weakly_connected_components(G: Graph[Hashable]) -> int: ...
+def number_weakly_connected_components(G: Graph[_Node]) -> int: ...
 @_dispatchable
-def is_weakly_connected(G: Graph[Hashable]) -> bool: ...
+def is_weakly_connected(G: Graph[_Node]) -> bool: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/connectivity.pyi CHANGED Viewed

@@ -1,6 +1,9 @@
 from _typeshed import Incomplete
+from collections.abc import Callable, Iterable
 from networkx.algorithms.flow import edmonds_karp
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 __all__ = [
@@ -11,40 +14,43 @@ __all__ = [
     "edge_connectivity",
     "all_pairs_node_connectivity",
 ]
 default_flow_func = edmonds_karp
 @_dispatchable
 def local_node_connectivity(
-    G,
-    s,
-    t,
-    flow_func: Incomplete | None = None,
-    auxiliary: Incomplete | None = None,
-    residual: Incomplete | None = None,
-    cutoff: Incomplete | None = None,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
+    flow_func: Callable[..., Incomplete] | None = None,
+    auxiliary: DiGraph[_Node] | None = None,
+    residual: DiGraph[_Node] | None = None,
+    cutoff: float | None = None,
 ): ...
 @_dispatchable
-def node_connectivity(G, s: Incomplete | None = None, t: Incomplete | None = None, flow_func: Incomplete | None = None): ...
+def node_connectivity(
+    G: Graph[_Node], s: _Node | None = None, t: _Node | None = None, flow_func: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def average_node_connectivity(G, flow_func: Incomplete | None = None): ...
+def average_node_connectivity(G: Graph[_Node], flow_func: Callable[..., Incomplete] | None = None): ...
 @_dispatchable
-def all_pairs_node_connectivity(G, nbunch: Incomplete | None = None, flow_func: Incomplete | None = None): ...
+def all_pairs_node_connectivity(
+    G: Graph[_Node], nbunch: Iterable[Incomplete] | None = None, flow_func: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
 def local_edge_connectivity(
-    G,
-    s,
-    t,
-    flow_func: Incomplete | None = None,
-    auxiliary: Incomplete | None = None,
-    residual: Incomplete | None = None,
-    cutoff: Incomplete | None = None,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
+    flow_func: Callable[..., Incomplete] | None = None,
+    auxiliary: DiGraph[_Node] | None = None,
+    residual: DiGraph[_Node] | None = None,
+    cutoff: float | None = None,
 ): ...
 @_dispatchable
 def edge_connectivity(
-    G,
-    s: Incomplete | None = None,
-    t: Incomplete | None = None,
-    flow_func: Incomplete | None = None,
-    cutoff: Incomplete | None = None,
+    G: Graph[_Node],
+    s: _Node | None = None,
+    t: _Node | None = None,
+    flow_func: Callable[..., Incomplete] | None = None,
+    cutoff: float | None = None,
 ): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/cuts.pyi CHANGED Viewed

@@ -1,21 +1,37 @@
 from _typeshed import Incomplete
+from collections.abc import Callable
 from networkx.algorithms.flow import edmonds_karp
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 __all__ = ["minimum_st_node_cut", "minimum_node_cut", "minimum_st_edge_cut", "minimum_edge_cut"]
 default_flow_func = edmonds_karp
 @_dispatchable
 def minimum_st_edge_cut(
-    G, s, t, flow_func: Incomplete | None = None, auxiliary: Incomplete | None = None, residual: Incomplete | None = None
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
+    flow_func: Callable[..., Incomplete] | None = None,
+    auxiliary: DiGraph[_Node] | None = None,
+    residual: DiGraph[_Node] | None = None,
 ): ...
 @_dispatchable
 def minimum_st_node_cut(
-    G, s, t, flow_func: Incomplete | None = None, auxiliary: Incomplete | None = None, residual: Incomplete | None = None
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
+    flow_func: Callable[..., Incomplete] | None = None,
+    auxiliary: DiGraph[_Node] | None = None,
+    residual: DiGraph[_Node] | None = None,
 ): ...
 @_dispatchable
-def minimum_node_cut(G, s: Incomplete | None = None, t: Incomplete | None = None, flow_func: Incomplete | None = None): ...
+def minimum_node_cut(
+    G: Graph[_Node], s: _Node | None = None, t: _Node | None = None, flow_func: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def minimum_edge_cut(G, s: Incomplete | None = None, t: Incomplete | None = None, flow_func: Incomplete | None = None): ...
+def minimum_edge_cut(
+    G: Graph[_Node], s: _Node | None = None, t: _Node | None = None, flow_func: Callable[..., Incomplete] | None = None
+): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/disjoint_paths.pyi CHANGED Viewed

@@ -1,30 +1,31 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Callable, Generator
 from networkx.algorithms.flow import edmonds_karp
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 __all__ = ["edge_disjoint_paths", "node_disjoint_paths"]
 default_flow_func = edmonds_karp
 @_dispatchable
 def edge_disjoint_paths(
-    G,
-    s,
-    t,
-    flow_func: Incomplete | None = None,
-    cutoff: Incomplete | None = None,
-    auxiliary: Incomplete | None = None,
-    residual: Incomplete | None = None,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
+    flow_func: Callable[..., Incomplete] | None = None,
+    cutoff: int | None = None,
+    auxiliary: DiGraph[_Node] | None = None,
+    residual: DiGraph[_Node] | None = None,
 ) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
 def node_disjoint_paths(
-    G,
-    s,
-    t,
-    flow_func: Incomplete | None = None,
-    cutoff: Incomplete | None = None,
-    auxiliary: Incomplete | None = None,
-    residual: Incomplete | None = None,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
+    flow_func: Callable[..., Incomplete] | None = None,
+    cutoff: int | None = None,
+    auxiliary: DiGraph[_Node] | None = None,
+    residual: DiGraph[_Node] | None = None,
 ) -> Generator[Incomplete, None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/edge_augmentation.pyi CHANGED Viewed

@@ -1,17 +1,18 @@
-from collections.abc import Generator, Hashable
+from _typeshed import SupportsGetItem
+from collections.abc import Generator
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_k_edge_connected(G: Graph[Hashable], k: int): ...
+def is_k_edge_connected(G: Graph[_Node], k: int): ...
 @_dispatchable
-def is_locally_k_edge_connected(G, s, t, k): ...
+def is_locally_k_edge_connected(G: Graph[_Node], s: _Node, t: _Node, k: int): ...
 @_dispatchable
 def k_edge_augmentation(
     G: Graph[_Node],
     k: int,
-    avail: tuple[_Node, _Node] | tuple[_Node, _Node, dict[str, int]] | None = None,
+    avail: set[tuple[int, int]] | set[tuple[int, int, float]] | SupportsGetItem[tuple[int, int], float] | None = None,
     weight: str | None = None,
     partial: bool = False,
 ) -> Generator[tuple[_Node, _Node], None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/edge_kcomponents.pyi CHANGED Viewed

@@ -1,19 +1,21 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def k_edge_components(G, k): ...
+def k_edge_components(G: Graph[_Node], k: int): ...
 @_dispatchable
-def k_edge_subgraphs(G, k): ...
+def k_edge_subgraphs(G: Graph[_Node], k: int): ...
 @_dispatchable
-def bridge_components(G) -> Generator[Incomplete, Incomplete, None]: ...
+def bridge_components(G: Graph[_Node]) -> Generator[Incomplete, Incomplete, None]: ...
 class EdgeComponentAuxGraph:
     A: Incomplete
     H: Incomplete
     @classmethod
     def construct(cls, G): ...
-    def k_edge_components(self, k) -> Generator[Incomplete, Incomplete, None]: ...
-    def k_edge_subgraphs(self, k) -> Generator[Incomplete, Incomplete, None]: ...
+    def k_edge_components(self, k: int) -> Generator[Incomplete, Incomplete, None]: ...
+    def k_edge_subgraphs(self, k: int) -> Generator[Incomplete, Incomplete, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/kcomponents.pyi CHANGED Viewed

@@ -1,11 +1,12 @@
 from _typeshed import Incomplete
+from collections.abc import Callable
 from networkx.algorithms.flow import edmonds_karp
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 __all__ = ["k_components"]
 default_flow_func = edmonds_karp
 @_dispatchable
-def k_components(G, flow_func: Incomplete | None = None): ...
+def k_components(G: Graph[_Node], flow_func: Callable[..., Incomplete] | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/kcutsets.pyi CHANGED Viewed

@@ -1,12 +1,14 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Callable, Generator
 from networkx.algorithms.flow import edmonds_karp
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 __all__ = ["all_node_cuts"]
 default_flow_func = edmonds_karp
 @_dispatchable
-def all_node_cuts(G, k: Incomplete | None = None, flow_func: Incomplete | None = None) -> Generator[Incomplete, None, None]: ...
+def all_node_cuts(
+    G: Graph[_Node], k: int | None = None, flow_func: Callable[..., Incomplete] | None = None
+) -> Generator[Incomplete, None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/connectivity/stoerwagner.pyi CHANGED Viewed

@@ -1,4 +1,5 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def stoer_wagner(G, weight: str = "weight", heap=...): ...
+def stoer_wagner(G: Graph[_Node], weight: str = "weight", heap: type = ...): ...