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/core.pyi CHANGED Viewed

@@ -1,18 +1,19 @@
-from _typeshed import Incomplete
+from _typeshed import Incomplete, SupportsGetItem
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def core_number(G): ...
+def core_number(G: Graph[_Node]): ...
 @_dispatchable
-def k_core(G, k: Incomplete | None = None, core_number: Incomplete | None = None): ...
+def k_core(G: Graph[_Node], k: int | None = None, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_shell(G, k: Incomplete | None = None, core_number: Incomplete | None = None): ...
+def k_shell(G: Graph[_Node], k: int | None = None, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_crust(G, k: Incomplete | None = None, core_number: Incomplete | None = None): ...
+def k_crust(G: Graph[_Node], k: int | None = None, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_corona(G, k, core_number: Incomplete | None = None): ...
+def k_corona(G: Graph[_Node], k: int, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_truss(G, k): ...
+def k_truss(G: Graph[_Node], k: int): ...
 @_dispatchable
-def onion_layers(G): ...
+def onion_layers(G: Graph[_Node]): ...

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

@@ -1,8 +1,10 @@
 from _typeshed import Incomplete
+from collections.abc import Callable
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def min_edge_cover(G, matching_algorithm: Incomplete | None = None): ...
+def min_edge_cover(G: Graph[_Node], matching_algorithm: Callable[..., Incomplete] | None = None): ...
 @_dispatchable
-def is_edge_cover(G, cover): ...
+def is_edge_cover(G: Graph[_Node], cover: set[Incomplete]): ...

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

@@ -1,20 +1,21 @@
-from _typeshed import Incomplete
+from collections.abc import Iterable
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def cut_size(G, S, T: Incomplete | None = None, weight: Incomplete | None = None): ...
+def cut_size(G: Graph[_Node], S: Iterable[_Node], T: Iterable[_Node] | None = None, weight: str | None = None): ...
 @_dispatchable
-def volume(G, S, weight: Incomplete | None = None): ...
+def volume(G: Graph[_Node], S: Iterable[_Node], weight: str | None = None): ...
 @_dispatchable
-def normalized_cut_size(G, S, T: Incomplete | None = None, weight: Incomplete | None = None): ...
+def normalized_cut_size(G: Graph[_Node], S: Iterable[_Node], T: Iterable[_Node] | None = None, weight: str | None = None): ...
 @_dispatchable
-def conductance(G, S, T: Incomplete | None = None, weight: Incomplete | None = None): ...
+def conductance(G: Graph[_Node], S: Iterable[_Node], T: Iterable[_Node] | None = None, weight: str | None = None): ...
 @_dispatchable
-def edge_expansion(G, S, T: Incomplete | None = None, weight: Incomplete | None = None): ...
+def edge_expansion(G: Graph[_Node], S: Iterable[_Node], T: Iterable[_Node] | None = None, weight: str | None = None): ...
 @_dispatchable
-def mixing_expansion(G, S, T: Incomplete | None = None, weight: Incomplete | None = None): ...
+def mixing_expansion(G: Graph[_Node], S: Iterable[_Node], T: Iterable[_Node] | None = None, weight: str | None = None): ...
 @_dispatchable
-def node_expansion(G, S): ...
+def node_expansion(G: Graph[_Node], S: Iterable[_Node]): ...
 @_dispatchable
-def boundary_expansion(G, S): ...
+def boundary_expansion(G: Graph[_Node], S: Iterable[_Node]): ...

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

@@ -1,23 +1,26 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def cycle_basis(G, root: Incomplete | None = None): ...
+def cycle_basis(G: Graph[_Node], root: _Node | None = None): ...
 @_dispatchable
-def simple_cycles(G, length_bound: Incomplete | None = None) -> Generator[Incomplete, Incomplete, None]: ...
+def simple_cycles(G: Graph[_Node], length_bound: int | None = None) -> Generator[Incomplete, Incomplete, None]: ...
 class _NeighborhoodCache(dict[Incomplete, Incomplete]):
     G: Incomplete
     def __init__(self, G) -> None: ...
     def __missing__(self, v): ...
 @_dispatchable
-def chordless_cycles(G, length_bound: Incomplete | None = None) -> Generator[Incomplete, Incomplete, None]: ...
+def chordless_cycles(G: DiGraph[_Node], length_bound: int | None = None) -> Generator[Incomplete, Incomplete, None]: ...
 @_dispatchable
-def recursive_simple_cycles(G): ...
+def recursive_simple_cycles(G: DiGraph[_Node]): ...
 @_dispatchable
-def find_cycle(G, source: Incomplete | None = None, orientation: Incomplete | None = None): ...
+def find_cycle(G: Graph[_Node], source=None, orientation=None): ...
 @_dispatchable
-def minimum_cycle_basis(G, weight: Incomplete | None = None): ...
+def minimum_cycle_basis(G: Graph[_Node], weight: str | None = None): ...

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

@@ -1,3 +1,5 @@
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
@@ -5,4 +7,4 @@ def d_separated(G, x, y, z): ...
 @_dispatchable
 def minimal_d_separator(G, u, v): ...
 @_dispatchable
-def is_minimal_d_separator(G, u, v, z): ...
+def is_minimal_d_separator(G: DiGraph[_Node], x, y, z, *, included=None, restricted=None): ...

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

@@ -1,14 +1,14 @@
-from _typeshed import SupportsRichComparison
-from collections.abc import Callable, Generator, Iterable, Reversible
+from _typeshed import Incomplete
+from collections.abc import Callable, Generator, Iterable
 from networkx.classes.digraph import DiGraph
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def descendants(G: Graph[_Node], source: _Node) -> set[_Node]: ...
+def descendants(G: Graph[_Node], source) -> set[_Node]: ...
 @_dispatchable
-def ancestors(G: Graph[_Node], source: _Node) -> set[_Node]: ...
+def ancestors(G: Graph[_Node], source) -> set[_Node]: ...
 @_dispatchable
 def is_directed_acyclic_graph(G: Graph[_Node]) -> bool: ...
 @_dispatchable
@@ -17,25 +17,28 @@ def topological_generations(G: DiGraph[_Node]) -> Generator[list[_Node], None, N
 def topological_sort(G: DiGraph[_Node]) -> Generator[_Node, None, None]: ...
 @_dispatchable
 def lexicographical_topological_sort(
-    G: DiGraph[_Node], key: Callable[[_Node], SupportsRichComparison] | None = None
+    G: DiGraph[_Node], key: Callable[..., Incomplete] | None = None
 ) -> Generator[_Node, None, None]: ...
 @_dispatchable
 def all_topological_sorts(G: DiGraph[_Node]) -> Generator[list[_Node], None, None]: ...
 @_dispatchable
 def is_aperiodic(G: DiGraph[_Node]) -> bool: ...
 @_dispatchable
-def transitive_closure(G: Graph[_Node], reflexive: bool = False) -> Graph[_Node]: ...
+def transitive_closure(G: Graph[_Node], reflexive=False) -> Graph[_Node]: ...
 @_dispatchable
-def transitive_closure_dag(G: DiGraph[_Node], reflexive: bool = False) -> DiGraph[_Node]: ...
+def transitive_closure_dag(G: DiGraph[_Node], topo_order: Iterable[Incomplete] | None = None) -> DiGraph[_Node]: ...
 @_dispatchable
 def transitive_reduction(G: DiGraph[_Node]) -> DiGraph[_Node]: ...
 @_dispatchable
-def antichains(G: DiGraph[_Node], topo_order: Reversible[_Node] | None = None) -> Generator[list[_Node], None, None]: ...
+def antichains(G: DiGraph[_Node], topo_order: Iterable[Incomplete] | None = None) -> Generator[list[_Node], None, None]: ...
 @_dispatchable
 def dag_longest_path(
-    G: DiGraph[_Node], weight: str = "weight", default_weight: int = 1, topo_order: Iterable[_Node] | None = None
+    G: DiGraph[_Node],
+    weight: str | None = "weight",
+    default_weight: int | None = 1,
+    topo_order: Iterable[Incomplete] | None = None,
 ) -> list[_Node]: ...
 @_dispatchable
-def dag_longest_path_length(G: DiGraph[_Node], weight: str = "weight", default_weight: int = 1) -> int: ...
+def dag_longest_path_length(G: DiGraph[_Node], weight: str | None = "weight", default_weight: int | None = 1) -> int: ...
 @_dispatchable
 def dag_to_branching(G: Graph[_Node]) -> Graph[_Node]: ...

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

@@ -1,18 +1,17 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def eccentricity(G, v: Incomplete | None = None, sp: Incomplete | None = None, weight: Incomplete | None = None): ...
+def eccentricity(G: Graph[_Node], v: _Node | None = None, sp=None, weight: str | None = None): ...
 @_dispatchable
-def diameter(G, e: Incomplete | None = None, usebounds: bool = False, weight: Incomplete | None = None): ...
+def diameter(G: Graph[_Node], e=None, usebounds=False, weight: str | None = None): ...
 @_dispatchable
-def periphery(G, e: Incomplete | None = None, usebounds: bool = False, weight: Incomplete | None = None): ...
+def periphery(G: Graph[_Node], e=None, usebounds=False, weight: str | None = None): ...
 @_dispatchable
-def radius(G, e: Incomplete | None = None, usebounds: bool = False, weight: Incomplete | None = None): ...
+def radius(G: Graph[_Node], e=None, usebounds=False, weight: str | None = None): ...
 @_dispatchable
-def center(G, e: Incomplete | None = None, usebounds: bool = False, weight: Incomplete | None = None): ...
+def center(G: Graph[_Node], e=None, usebounds=False, weight: str | None = None): ...
 @_dispatchable
-def barycenter(G, weight: Incomplete | None = None, attr: Incomplete | None = None, sp: Incomplete | None = None): ...
+def barycenter(G, weight: str | None = None, attr=None, sp=None): ...
 @_dispatchable
-def resistance_distance(G, nodeA, nodeB, weight: Incomplete | None = None, invert_weight: bool = True): ...
+def resistance_distance(G: Graph[_Node], nodeA=None, nodeB=None, weight: str | None = None, invert_weight: bool = True): ...

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

@@ -1,10 +1,11 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_distance_regular(G): ...
+def is_distance_regular(G: Graph[_Node]): ...
 @_dispatchable
 def global_parameters(b, c): ...
 @_dispatchable
-def intersection_array(G): ...
+def intersection_array(G: Graph[_Node]): ...
 @_dispatchable
-def is_strongly_regular(G): ...
+def is_strongly_regular(G: Graph[_Node]): ...

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

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

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

@@ -1,8 +1,10 @@
 from _typeshed import Incomplete
+from collections.abc import Iterable
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def dominating_set(G, start_with: Incomplete | None = None): ...
+def dominating_set(G: Graph[_Node], start_with: _Node | None = None): ...
 @_dispatchable
-def is_dominating_set(G, nbunch): ...
+def is_dominating_set(G: Graph[_Node], nbunch: Iterable[Incomplete]): ...

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

@@ -1,7 +1,8 @@
+from networkx.classes.graph import _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def efficiency(G, u, v): ...
+def efficiency(G, u: _Node, v: _Node): ...
 @_dispatchable
 def global_efficiency(G): ...
 @_dispatchable

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

@@ -1,17 +1,20 @@
 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_eulerian(G): ...
+def is_eulerian(G: Graph[_Node]): ...
 @_dispatchable
 def is_semieulerian(G): ...
 @_dispatchable
-def eulerian_circuit(G, source: Incomplete | None = None, keys: bool = False) -> Generator[Incomplete, Incomplete, None]: ...
+def eulerian_circuit(
+    G: Graph[_Node], source: _Node | None = None, keys: bool = False
+) -> Generator[Incomplete, Incomplete, None]: ...
 @_dispatchable
-def has_eulerian_path(G, source: Incomplete | None = None): ...
+def has_eulerian_path(G: Graph[_Node], source: _Node | None = None): ...
 @_dispatchable
-def eulerian_path(G, source: Incomplete | None = None, keys: bool = False) -> Generator[Incomplete, Incomplete, None]: ...
+def eulerian_path(G: Graph[_Node], source=None, keys: bool = False) -> Generator[Incomplete, Incomplete, None]: ...
 @_dispatchable
-def eulerize(G): ...
+def eulerize(G: Graph[_Node]): ...

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

@@ -1,14 +1,13 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def boykov_kolmogorov(
-    G,
-    s,
-    t,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
     capacity: str = "capacity",
-    residual: Incomplete | None = None,
+    residual: Graph[_Node] | None = None,
     value_only: bool = False,
-    cutoff: Incomplete | None = None,
+    cutoff: float | None = None,
 ): ...

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

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

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

@@ -1,14 +1,13 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def dinitz(
-    G,
-    s,
-    t,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
     capacity: str = "capacity",
-    residual: Incomplete | None = None,
+    residual: Graph[_Node] | None = None,
     value_only: bool = False,
-    cutoff: Incomplete | None = None,
+    cutoff: float | None = None,
 ): ...

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

@@ -1,14 +1,13 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def edmonds_karp(
-    G,
-    s,
-    t,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
     capacity: str = "capacity",
-    residual: Incomplete | None = None,
+    residual: Graph[_Node] | None = None,
     value_only: bool = False,
-    cutoff: Incomplete | None = None,
+    cutoff: float | None = None,
 ): ...

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

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

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

@@ -1,18 +1,47 @@
 from _typeshed import Incomplete
+from collections.abc import Callable
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 from .preflowpush import preflow_push
 __all__ = ["maximum_flow", "maximum_flow_value", "minimum_cut", "minimum_cut_value"]
 default_flow_func = preflow_push
 @_dispatchable
-def maximum_flow(flowG, _s, _t, capacity: str = "capacity", flow_func: Incomplete | None = None, **kwargs): ...
+def maximum_flow(
+    flowG: Graph[_Node],
+    _s: _Node,
+    _t: _Node,
+    capacity: str = "capacity",
+    flow_func: Callable[..., Incomplete] | None = None,
+    **kwargs,
+): ...
 @_dispatchable
-def maximum_flow_value(flowG, _s, _t, capacity: str = "capacity", flow_func: Incomplete | None = None, **kwargs): ...
+def maximum_flow_value(
+    flowG: Graph[_Node],
+    _s: _Node,
+    _t: _Node,
+    capacity: str = "capacity",
+    flow_func: Callable[..., Incomplete] | None = None,
+    **kwargs,
+): ...
 @_dispatchable
-def minimum_cut(flowG, _s, _t, capacity: str = "capacity", flow_func: Incomplete | None = None, **kwargs): ...
+def minimum_cut(
+    flowG: Graph[_Node],
+    _s: _Node,
+    _t: _Node,
+    capacity: str = "capacity",
+    flow_func: Callable[..., Incomplete] | None = None,
+    **kwargs,
+): ...
 @_dispatchable
-def minimum_cut_value(flowG, _s, _t, capacity: str = "capacity", flow_func: Incomplete | None = None, **kwargs): ...
+def minimum_cut_value(
+    flowG: Graph[_Node],
+    _s: _Node,
+    _t: _Node,
+    capacity: str = "capacity",
+    flow_func: Callable[..., Incomplete] | None = None,
+    **kwargs,
+): ...

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

@@ -1,10 +1,13 @@
+from _typeshed import Incomplete, SupportsGetItem
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def min_cost_flow_cost(G, 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"): ...
 @_dispatchable
-def min_cost_flow(G, demand: str = "demand", capacity: str = "capacity", weight: str = "weight"): ...
+def min_cost_flow(G: Graph[_Node], demand: str = "demand", capacity: str = "capacity", weight: str = "weight"): ...
 @_dispatchable
-def cost_of_flow(G, flowDict, weight: str = "weight"): ...
+def cost_of_flow(G: Graph[_Node], flowDict: SupportsGetItem[Incomplete, Incomplete], weight: str = "weight"): ...
 @_dispatchable
-def max_flow_min_cost(G, s, t, capacity: str = "capacity", weight: str = "weight"): ...
+def max_flow_min_cost(G: Graph[_Node], s: str, t: str, capacity: str = "capacity", weight: str = "weight"): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/flow/networksimplex.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
 class _DataEssentialsAndFunctions:
@@ -22,6 +23,7 @@ class _DataEssentialsAndFunctions:
     next_node_dft: Incomplete
     prev_node_dft: Incomplete
     last_descendent_dft: Incomplete
     def __init__(self, G, multigraph, demand: str = "demand", capacity: str = "capacity", weight: str = "weight") -> None: ...
     def initialize_spanning_tree(self, n, faux_inf) -> None: ...
     def find_apex(self, p, q): ...
@@ -39,4 +41,4 @@ class _DataEssentialsAndFunctions:
     def find_leaving_edge(self, Wn, We): ...
 @_dispatchable
-def network_simplex(G, demand: str = "demand", capacity: str = "capacity", weight: str = "weight"): ...
+def network_simplex(G: Graph[_Node], demand: str = "demand", capacity: str = "capacity", weight: str = "weight"): ...

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

@@ -1,14 +1,13 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def preflow_push(
-    G,
-    s,
-    t,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
     capacity: str = "capacity",
-    residual: Incomplete | None = None,
+    residual: Graph[_Node] | None = None,
     global_relabel_freq: float = 1,
     value_only: bool = False,
 ): ...

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

@@ -1,15 +1,14 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def shortest_augmenting_path(
-    G,
-    s,
-    t,
+    G: Graph[_Node],
+    s: _Node,
+    t: _Node,
     capacity: str = "capacity",
-    residual: Incomplete | None = None,
+    residual: Graph[_Node] | None = None,
     value_only: bool = False,
     two_phase: bool = False,
-    cutoff: Incomplete | None = None,
+    cutoff: float | None = None,
 ): ...

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

@@ -10,6 +10,7 @@ class CurrentEdge:
 class Level:
     active: Incomplete
     inactive: Incomplete
     def __init__(self) -> None: ...
 class GlobalRelabelThreshold:

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

@@ -1,12 +1,20 @@
-from _typeshed import Incomplete
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
 def weisfeiler_lehman_graph_hash(
-    G, edge_attr: Incomplete | None = None, node_attr: Incomplete | None = None, iterations: int = 3, digest_size: int = 16
+    G: Graph[_Node],
+    edge_attr: str | None = None,
+    node_attr: str | None = None,
+    iterations: int | None = 3,
+    digest_size: int | None = 16,
 ): ...
 @_dispatchable
 def weisfeiler_lehman_subgraph_hashes(
-    G, edge_attr: Incomplete | None = None, node_attr: Incomplete | None = None, iterations: int = 3, digest_size: int = 16
+    G: Graph[_Node],
+    edge_attr: str | None = None,
+    node_attr: str | None = None,
+    iterations: int | None = 3,
+    digest_size: int | None = 16,
+    include_initial_labels: bool | None = False,
 ): ...

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

@@ -1,14 +1,17 @@
+from _typeshed import Incomplete
+from collections.abc import Iterable
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_graphical(sequence, method: str = "eg"): ...
+def is_graphical(sequence: Iterable[Incomplete], method="eg"): ...
 @_dispatchable
-def is_valid_degree_sequence_havel_hakimi(deg_sequence): ...
+def is_valid_degree_sequence_havel_hakimi(deg_sequence: Iterable[Incomplete]): ...
 @_dispatchable
-def is_valid_degree_sequence_erdos_gallai(deg_sequence): ...
+def is_valid_degree_sequence_erdos_gallai(deg_sequence: Iterable[Incomplete]): ...
 @_dispatchable
-def is_multigraphical(sequence): ...
+def is_multigraphical(sequence: Iterable[Incomplete]): ...
 @_dispatchable
-def is_pseudographical(sequence): ...
+def is_pseudographical(sequence: Iterable[Incomplete]): ...
 @_dispatchable
-def is_digraphical(in_sequence, out_sequence): ...
+def is_digraphical(in_sequence: Iterable[Incomplete], out_sequence: Iterable[Incomplete]): ...

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

@@ -1,6 +1,4 @@
-from _typeshed import Incomplete
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def flow_hierarchy(G, weight: Incomplete | None = None): ...
+def flow_hierarchy(G, weight: str | None = None): ...

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

@@ -1,6 +1,7 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def kl_connected_subgraph(G, k, l, low_memory: bool = False, same_as_graph: bool = False): ...
+def kl_connected_subgraph(G: Graph[_Node], k: int, l: int, low_memory: bool = False, same_as_graph: bool = False): ...
 @_dispatchable
-def is_kl_connected(G, k, l, low_memory: bool = False): ...
+def is_kl_connected(G: Graph[_Node], k: int, l: int, low_memory: bool = False): ...

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

@@ -1,8 +1,9 @@
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 @_dispatchable
-def is_isolate(G, n): ...
+def is_isolate(G: Graph[_Node], n: _Node): ...
 @_dispatchable
-def isolates(G): ...
+def isolates(G: Graph[_Node]): ...
 @_dispatchable
-def number_of_isolates(G): ...
+def number_of_isolates(G: Graph[_Node]): ...

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

@@ -6,6 +6,7 @@ class ISMAGS:
     subgraph: Incomplete
     node_equality: Incomplete
     edge_equality: Incomplete
     def __init__(
         self,
         graph,