basedpyright 1.28.3 → 1.28.4

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/isomorphism/isomorph.pyi

@@ -1,23 +1,30 @@
 from _typeshed import Incomplete
+from collections.abc import Callable
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 __all__ = ["could_be_isomorphic", "fast_could_be_isomorphic", "faster_could_be_isomorphic", "is_isomorphic"]
 
 @_dispatchable
-def could_be_isomorphic(G1, G2): ...
+def could_be_isomorphic(G1: Graph[_Node], G2: Graph[_Node]): ...
 
 graph_could_be_isomorphic = could_be_isomorphic
 
 @_dispatchable
-def fast_could_be_isomorphic(G1, G2): ...
+def fast_could_be_isomorphic(G1: Graph[_Node], G2: Graph[_Node]): ...
 
 fast_graph_could_be_isomorphic = fast_could_be_isomorphic
 
 @_dispatchable
-def faster_could_be_isomorphic(G1, G2): ...
+def faster_could_be_isomorphic(G1: Graph[_Node], G2: Graph[_Node]): ...
 
 faster_graph_could_be_isomorphic = faster_could_be_isomorphic
 
 @_dispatchable
-def is_isomorphic(G1, G2, node_match: Incomplete | None = None, edge_match: Incomplete | None = None): ...
+def is_isomorphic(
+    G1: Graph[_Node],
+    G2: Graph[_Node],
+    node_match: Callable[..., Incomplete] | None = None,
+    edge_match: Callable[..., Incomplete] | None = None,
+): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/isomorphism/isomorphvf2.pyi

@@ -11,6 +11,7 @@ class GraphMatcher:
     G2_node_order: Incomplete
     old_recursion_limit: Incomplete
     test: str
+
     def __init__(self, G1, G2) -> None: ...
     def reset_recursion_limit(self) -> None: ...
     def candidate_pairs_iter(self) -> Generator[Incomplete, None, None]: ...
@@ -20,6 +21,7 @@ class GraphMatcher:
     inout_2: Incomplete
     state: Incomplete
     mapping: Incomplete
+
     def initialize(self) -> None: ...
     def is_isomorphic(self): ...
     def isomorphisms_iter(self) -> Generator[Incomplete, Incomplete, None]: ...
@@ -42,6 +44,7 @@ class DiGraphMatcher(GraphMatcher):
     out_2: Incomplete
     state: Incomplete
     mapping: Incomplete
+
     def initialize(self) -> None: ...
     def syntactic_feasibility(self, G1_node, G2_node): ...
 
@@ -50,6 +53,7 @@ class GMState:
     G1_node: Incomplete
     G2_node: Incomplete
     depth: Incomplete
+
     def __init__(self, GM, G1_node: Incomplete | None = None, G2_node: Incomplete | None = None) -> None: ...
     def restore(self) -> None: ...
 
@@ -58,5 +62,6 @@ class DiGMState:
     G1_node: Incomplete
     G2_node: Incomplete
     depth: Incomplete
+
     def __init__(self, GM, G1_node: Incomplete | None = None, G2_node: Incomplete | None = None) -> None: ...
     def restore(self) -> None: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/isomorphism/temporalisomorphvf2.pyi

@@ -7,6 +7,7 @@ __all__ = ["TimeRespectingGraphMatcher", "TimeRespectingDiGraphMatcher"]
 class TimeRespectingGraphMatcher(GraphMatcher):
     temporal_attribute_name: Incomplete
     delta: Incomplete
+
     def __init__(self, G1, G2, temporal_attribute_name, delta) -> None: ...
     def one_hop(self, Gx, Gx_node, neighbors): ...
     def two_hop(self, Gx, core_x, Gx_node, neighbors): ...
@@ -15,6 +16,7 @@ class TimeRespectingGraphMatcher(GraphMatcher):
 class TimeRespectingDiGraphMatcher(DiGraphMatcher):
     temporal_attribute_name: Incomplete
     delta: Incomplete
+
     def __init__(self, G1, G2, temporal_attribute_name, delta) -> None: ...
     def get_pred_dates(self, Gx, Gx_node, core_x, pred): ...
     def get_succ_dates(self, Gx, Gx_node, core_x, succ): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/isomorphism/tree_isomorphism.pyi

@@ -1,6 +1,7 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
 def rooted_tree_isomorphism(t1, root1, t2, root2): ...
 @_dispatchable
-def tree_isomorphism(t1, t2): ...
+def tree_isomorphism(t1: Graph[_Node], t2: Graph[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/isomorphism/vf2pp.pyi

@@ -2,6 +2,7 @@ from _typeshed import Incomplete
 from collections.abc import Generator
 from typing import NamedTuple
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 class _GraphParameters(NamedTuple):
@@ -26,10 +27,12 @@ class _StateParameters(NamedTuple):
     T2_tilde_in: Incomplete
 
 @_dispatchable
-def vf2pp_isomorphism(G1, G2, node_label: Incomplete | None = None, default_label: Incomplete | None = None): ...
+def vf2pp_isomorphism(G1: Graph[_Node], G2: Graph[_Node], node_label: str | None = None, default_label: float | None = None): ...
 @_dispatchable
-def vf2pp_is_isomorphic(G1, G2, node_label: Incomplete | None = None, default_label: Incomplete | None = None): ...
+def vf2pp_is_isomorphic(
+    G1: Graph[_Node], G2: Graph[_Node], node_label: str | None = None, default_label: float | None = None
+): ...
 @_dispatchable
 def vf2pp_all_isomorphisms(
-    G1, G2, node_label: Incomplete | None = None, default_label: Incomplete | None = None
+    G1: Graph[_Node], G2: Graph[_Node], node_label: str | None = None, default_label: float | None = None
 ) -> Generator[Incomplete, None, Incomplete]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/isomorphism/vf2userfunc.pyi

@@ -9,6 +9,7 @@ class GraphMatcher(vf2.GraphMatcher):
     edge_match: Incomplete
     G1_adj: Incomplete
     G2_adj: Incomplete
+
     def __init__(self, G1, G2, node_match: Incomplete | None = None, edge_match: Incomplete | None = None) -> None: ...
     semantic_feasibility: Incomplete
 
@@ -17,6 +18,7 @@ class DiGraphMatcher(vf2.DiGraphMatcher):
     edge_match: Incomplete
     G1_adj: Incomplete
     G2_adj: Incomplete
+
     def __init__(self, G1, G2, node_match: Incomplete | None = None, edge_match: Incomplete | None = None) -> None: ...
     def semantic_feasibility(self, G1_node, G2_node): ...
 

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/link_analysis/hits_alg.pyi

@@ -1,6 +1,13 @@
-from _typeshed import Incomplete
+from _typeshed import Incomplete, SupportsGetItem
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def hits(G, max_iter: int = 100, tol: float = 1e-08, nstart: Incomplete | None = None, normalized: bool = True): ...
+def hits(
+    G: Graph[_Node],
+    max_iter: int | None = 100,
+    tol: float | None = 1e-08,
+    nstart: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    normalized: bool = True,
+): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/link_analysis/pagerank_alg.pyi

@@ -1,24 +1,26 @@
-from _typeshed import Incomplete
+from _typeshed import Incomplete, SupportsGetItem
+from collections.abc import Iterable
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
 def pagerank(
-    G,
-    alpha: float = 0.85,
-    personalization: Incomplete | None = None,
-    max_iter: int = 100,
-    tol: float = 1e-06,
-    nstart: Incomplete | None = None,
-    weight: str = "weight",
-    dangling: Incomplete | None = None,
+    G: Graph[_Node],
+    alpha: float | None = 0.85,
+    personalization: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    max_iter: int | None = 100,
+    tol: float | None = 1e-06,
+    nstart: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    weight: str | None = "weight",
+    dangling: SupportsGetItem[Incomplete, Incomplete] | None = None,
 ): ...
 @_dispatchable
 def google_matrix(
-    G,
+    G: Graph[_Node],
     alpha: float = 0.85,
-    personalization: Incomplete | None = None,
-    nodelist: Incomplete | None = None,
-    weight: str = "weight",
-    dangling: Incomplete | None = None,
+    personalization: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    nodelist: Iterable[Incomplete] | None = None,
+    weight: str | None = "weight",
+    dangling: SupportsGetItem[Incomplete, Incomplete] | None = None,
 ): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/link_prediction.pyi

@@ -1,20 +1,19 @@
-from _typeshed import Incomplete
-
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def resource_allocation_index(G, ebunch: Incomplete | None = None): ...
+def resource_allocation_index(G: Graph[_Node], ebunch=None): ...
 @_dispatchable
-def jaccard_coefficient(G, ebunch: Incomplete | None = None): ...
+def jaccard_coefficient(G: Graph[_Node], ebunch=None): ...
 @_dispatchable
-def adamic_adar_index(G, ebunch: Incomplete | None = None): ...
+def adamic_adar_index(G: Graph[_Node], ebunch=None): ...
 @_dispatchable
-def common_neighbor_centrality(G, ebunch: Incomplete | None = None, alpha: float = 0.8): ...
+def common_neighbor_centrality(G: Graph[_Node], ebunch=None, alpha=0.8): ...
 @_dispatchable
-def preferential_attachment(G, ebunch: Incomplete | None = None): ...
+def preferential_attachment(G: Graph[_Node], ebunch=None): ...
 @_dispatchable
-def cn_soundarajan_hopcroft(G, ebunch: Incomplete | None = None, community: str = "community"): ...
+def cn_soundarajan_hopcroft(G: Graph[_Node], ebunch=None, community: str | None = "community"): ...
 @_dispatchable
-def ra_index_soundarajan_hopcroft(G, ebunch: Incomplete | None = None, community: str = "community"): ...
+def ra_index_soundarajan_hopcroft(G: Graph[_Node], ebunch=None, community: str | None = "community"): ...
 @_dispatchable
-def within_inter_cluster(G, ebunch: Incomplete | None = None, delta: float = 0.001, community: str = "community"): ...
+def within_inter_cluster(G: Graph[_Node], ebunch=None, delta: float | None = 0.001, community: str | None = "community"): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/lowest_common_ancestors.pyi

@@ -1,13 +1,15 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
 
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def all_pairs_lowest_common_ancestor(G, pairs: Incomplete | None = None): ...
+def all_pairs_lowest_common_ancestor(G: DiGraph[_Node], pairs=None): ...
 @_dispatchable
-def lowest_common_ancestor(G, node1, node2, default: Incomplete | None = None): ...
+def lowest_common_ancestor(G: DiGraph[_Node], node1, node2, default: Incomplete | None = None): ...
 @_dispatchable
 def tree_all_pairs_lowest_common_ancestor(
-    G, root: Incomplete | None = None, pairs: Incomplete | None = None
+    G: DiGraph[_Node], root: _Node | None = None, pairs=None
 ) -> Generator[Incomplete, None, None]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/matching.pyi

@@ -1,14 +1,15 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def maximal_matching(G): ...
+def maximal_matching(G: Graph[_Node]): ...
 @_dispatchable
-def is_matching(G, matching): ...
+def is_matching(G: Graph[_Node], matching): ...
 @_dispatchable
-def is_maximal_matching(G, matching): ...
+def is_maximal_matching(G: Graph[_Node], matching): ...
 @_dispatchable
-def is_perfect_matching(G, matching): ...
+def is_perfect_matching(G: Graph[_Node], matching): ...
 @_dispatchable
-def min_weight_matching(G, weight: str = "weight"): ...
+def min_weight_matching(G: Graph[_Node], weight: str | None = "weight"): ...
 @_dispatchable
-def max_weight_matching(G, maxcardinality: bool = False, weight: str = "weight"): ...
+def max_weight_matching(G: Graph[_Node], maxcardinality: bool | None = False, weight: str | None = "weight"): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/minors/contraction.pyi

@@ -1,23 +1,26 @@
 from _typeshed import Incomplete
+from collections.abc import Callable
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
 def equivalence_classes(iterable, relation): ...
 @_dispatchable
 def quotient_graph(
-    G,
+    G: Graph[_Node],
     partition,
-    edge_relation: Incomplete | None = None,
-    node_data: Incomplete | None = None,
-    edge_data: Incomplete | None = None,
+    edge_relation=None,
+    node_data: Callable[..., Incomplete] | None = None,
+    edge_data: Callable[..., Incomplete] | None = None,
+    weight: str | None = "weight",
     relabel: bool = False,
-    create_using: Incomplete | None = None,
+    create_using: Graph[_Node] | None = None,
 ): ...
 @_dispatchable
-def contracted_nodes(G, u, v, self_loops: bool = True, copy: bool = True): ...
+def contracted_nodes(G: Graph[_Node], u, v, self_loops: bool = True, copy: bool = True): ...
 
 identified_nodes = contracted_nodes
 
 @_dispatchable
-def contracted_edge(G, edge, self_loops: bool = True, copy: bool = True): ...
+def contracted_edge(G: Graph[_Node], edge: tuple[Incomplete], self_loops: bool = True, copy: bool = True): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/mis.pyi

@@ -1,6 +1,11 @@
 from _typeshed import Incomplete
+from collections.abc import Iterable
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 
 @_dispatchable
-def maximal_independent_set(G, nodes: Incomplete | None = None, seed: Incomplete | None = None): ...
+def maximal_independent_set(
+    G: Graph[_Node], nodes: Iterable[Incomplete] | None = None, seed: int | RandomState | None = None
+): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/moral.pyi

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

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/node_classification.pyi

@@ -1,6 +1,7 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def harmonic_function(G, max_iter: int = 30, label_name: str = "label"): ...
+def harmonic_function(G: Graph[_Node], max_iter: int = 30, label_name: str = "label"): ...
 @_dispatchable
-def local_and_global_consistency(G, alpha: float = 0.99, max_iter: int = 30, label_name: str = "label"): ...
+def local_and_global_consistency(G: Graph[_Node], alpha: float = 0.99, max_iter: int = 30, label_name: str = "label"): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/non_randomness.pyi

@@ -1,6 +1,5 @@
-from _typeshed import Incomplete
-
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def non_randomness(G, k: Incomplete | None = None, weight: str = "weight"): ...
+def non_randomness(G: Graph[_Node], k: int | None = None, weight: str | None = "weight"): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/operators/all.pyi

@@ -1,10 +1,13 @@
+from _typeshed import Incomplete
+from collections.abc import Iterable
+
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def union_all(graphs, rename=()): ...
+def union_all(graphs: Iterable[Incomplete], rename: Iterable[Incomplete] | None = ()): ...
 @_dispatchable
-def disjoint_union_all(graphs): ...
+def disjoint_union_all(graphs: Iterable[Incomplete]): ...
 @_dispatchable
-def compose_all(graphs): ...
+def compose_all(graphs: Iterable[Incomplete]): ...
 @_dispatchable
-def intersection_all(graphs): ...
+def intersection_all(graphs: Iterable[Incomplete]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/operators/binary.pyi

@@ -1,24 +1,24 @@
-from collections.abc import Hashable
+from _typeshed import Incomplete
+from collections.abc import Hashable, Iterable
 from typing import TypeVar
 
 from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def disjoint_union(G, H): ...
+def disjoint_union(G: Graph[_Node], H: Graph[_Node]): ...
 @_dispatchable
-def intersection(G, H): ...
+def intersection(G: Graph[_Node], H: Graph[_Node]): ...
 @_dispatchable
-def difference(G, H): ...
+def difference(G: Graph[_Node], H: Graph[_Node]): ...
 @_dispatchable
-def symmetric_difference(G, H): ...
+def symmetric_difference(G: Graph[_Node], H: Graph[_Node]): ...
 
-_X = TypeVar("_X", bound=Hashable, covariant=True)
-_Y = TypeVar("_Y", bound=Hashable, covariant=True)
-# GT = TypeVar('GT', bound=Graph[_Node])
-# TODO: This does not handle the cases when graphs of different types are passed which is allowed
+_X_co = TypeVar("_X_co", bound=Hashable, covariant=True)
+_Y_co = TypeVar("_Y_co", bound=Hashable, covariant=True)
 
 @_dispatchable
-def compose(G: DiGraph[_X], H: DiGraph[_Y]) -> DiGraph[_X | _Y]: ...
+def compose(G: Graph[_X_co], H: Graph[_Y_co]) -> DiGraph[_X_co | _Y_co]: ...
 @_dispatchable
-def union(G: DiGraph[_X], H: DiGraph[_Y], rename=()) -> DiGraph[_X | _Y]: ...
+def union(G: Graph[_X_co], H: Graph[_Y_co], rename: Iterable[Incomplete] | None = ()) -> DiGraph[_X_co | _Y_co]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/operators/product.pyi

@@ -1,16 +1,23 @@
+from collections.abc import Hashable
+from typing import TypeVar
+
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
+_X = TypeVar("_X", bound=Hashable)
+_Y = TypeVar("_Y", bound=Hashable)
+
 @_dispatchable
-def tensor_product(G, H): ...
+def tensor_product(G: Graph[_X], H: Graph[_Y]) -> Graph[tuple[_X, _Y]]: ...
 @_dispatchable
-def cartesian_product(G, H): ...
+def cartesian_product(G: Graph[_X], H: Graph[_Y]) -> Graph[tuple[_X, _Y]]: ...
 @_dispatchable
-def lexicographic_product(G, H): ...
+def lexicographic_product(G: Graph[_X], H: Graph[_Y]) -> Graph[tuple[_X, _Y]]: ...
 @_dispatchable
-def strong_product(G, H): ...
+def strong_product(G: Graph[_X], H: Graph[_Y]) -> Graph[tuple[_X, _Y]]: ...
 @_dispatchable
-def power(G, k): ...
+def power(G: Graph[_Node], k): ...
 @_dispatchable
-def rooted_product(G, H, root): ...
+def rooted_product(G: Graph[_X], H: Graph[_Y], root: _Y) -> Graph[tuple[_X, _Y]]: ...
 @_dispatchable
-def corona_product(G, H): ...
+def corona_product(G: Graph[_X], H: Graph[_Y]) -> Graph[tuple[_X, _Y]]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/operators/unary.pyi

@@ -1,12 +1,12 @@
 from collections.abc import Hashable
 from typing import TypeVar
 
-from networkx.classes.graph import Graph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 _G = TypeVar("_G", bound=Graph[Hashable])
 
 @_dispatchable
-def complement(G): ...
+def complement(G: Graph[_Node]): ...
 @_dispatchable
 def reverse(G: _G, copy: bool = True) -> _G: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/planarity.pyi

@@ -2,19 +2,20 @@ from _typeshed import Incomplete
 from collections.abc import Generator, Mapping, MutableSet, Reversible
 
 from networkx.classes.digraph import DiGraph
-from networkx.classes.graph import _Node
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 __all__ = ["check_planarity", "is_planar", "PlanarEmbedding"]
 
 @_dispatchable
-def is_planar(G) -> bool: ...
+def is_planar(G: Graph[_Node]) -> bool: ...
 @_dispatchable
-def check_planarity(G, counterexample: bool = False): ...
+def check_planarity(G: Graph[_Node], counterexample: bool = False): ...
 
 class Interval:
     low: Incomplete
     high: Incomplete
+
     def __init__(self, low: Incomplete | None = None, high: Incomplete | None = None) -> None: ...
     def empty(self): ...
     def copy(self): ...
@@ -23,6 +24,7 @@ class Interval:
 class ConflictPair:
     left: Incomplete
     right: Incomplete
+
     def __init__(self, left=..., right=...) -> None: ...
     def swap(self) -> None: ...
     def lowest(self, planarity_state): ...
@@ -46,6 +48,7 @@ class LRPlanarity:
     left_ref: Incomplete
     right_ref: Incomplete
     embedding: Incomplete
+
     def __init__(self, G) -> None: ...
     def lr_planarity(self): ...
     def lr_planarity_recursive(self): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/polynomials.pyi

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

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/reciprocity.pyi

@@ -1,8 +1,9 @@
-from _typeshed import Incomplete
+from collections.abc import Iterable
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def reciprocity(G, nodes: Incomplete | None = None): ...
+def reciprocity(G: Graph[_Node], nodes: Iterable[_Node] | None = None): ...
 @_dispatchable
-def overall_reciprocity(G): ...
+def overall_reciprocity(G: Graph[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/regular.pyi

@@ -1,8 +1,9 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def is_regular(G): ...
+def is_regular(G: Graph[_Node]): ...
 @_dispatchable
-def is_k_regular(G, k): ...
+def is_k_regular(G: Graph[_Node], k): ...
 @_dispatchable
-def k_factor(G, k, matching_weight: str = "weight"): ...
+def k_factor(G: Graph[_Node], k, matching_weight: str | None = "weight"): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/richclub.pyi

@@ -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 rich_club_coefficient(G, normalized: bool = True, Q: float = 100, seed: Incomplete | None = None): ...
+def rich_club_coefficient(G: Graph[_Node], normalized: bool = True, Q: float = 100, seed: int | RandomState | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/shortest_paths/astar.pyi

@@ -1,8 +1,27 @@
-from _typeshed import Incomplete
+from _typeshed import Incomplete, SupportsGetItem
+from collections.abc import Callable
+from typing import Any
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def astar_path(G, source, target, heuristic: Incomplete | None = None, weight: str = "weight"): ...
+def astar_path(
+    G: Graph[_Node],
+    source: _Node,
+    target: _Node,
+    heuristic: Callable[..., Incomplete] | None = None,
+    weight: str | Callable[[Any, Any, SupportsGetItem[str, Any]], float | None] | None = "weight",
+    *,
+    cutoff: float | None = None,
+): ...
 @_dispatchable
-def astar_path_length(G, source, target, heuristic: Incomplete | None = None, weight: str = "weight"): ...
+def astar_path_length(
+    G: Graph[_Node],
+    source: _Node,
+    target: _Node,
+    heuristic: Callable[..., Incomplete] | None = None,
+    weight: str | Callable[[Any, Any, SupportsGetItem[str, Any]], float | None] | None = "weight",
+    *,
+    cutoff: float | None = None,
+): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/shortest_paths/dense.pyi

@@ -1,12 +1,14 @@
-from _typeshed import Incomplete
+from _typeshed import Incomplete, SupportsGetItem
+from collections.abc import Iterable
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def floyd_warshall_numpy(G, nodelist: Incomplete | None = None, weight: str = "weight"): ...
+def floyd_warshall_numpy(G: Graph[_Node], nodelist: Iterable[Incomplete] | None = None, weight: str | None = "weight"): ...
 @_dispatchable
-def floyd_warshall_predecessor_and_distance(G, weight: str = "weight"): ...
+def floyd_warshall_predecessor_and_distance(G: Graph[_Node], weight: str | None = "weight"): ...
 @_dispatchable
-def reconstruct_path(source, target, predecessors): ...
+def reconstruct_path(source: _Node, target: _Node, predecessors: SupportsGetItem[Incomplete, Incomplete]): ...
 @_dispatchable
-def floyd_warshall(G, weight: str = "weight"): ...
+def floyd_warshall(G: Graph[_Node], weight: str | None = "weight"): ...