basedpyright 1.36.2 → 1.37.0-961d59bacff1958014fe4e9ed2ef3116fe2266e2

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/centrality/subgraph_alg.pyi

@@ -6,9 +6,9 @@ from networkx.utils.backends import _dispatchable
 __all__ = ["subgraph_centrality_exp", "subgraph_centrality", "communicability_betweenness_centrality", "estrada_index"]
 
 @_dispatchable
-def subgraph_centrality_exp(G: Graph[_Node]) -> dict[Incomplete, float]: ...
+def subgraph_centrality_exp(G: Graph[_Node], *, normalized: bool = False) -> dict[Incomplete, float]: ...
 @_dispatchable
-def subgraph_centrality(G: Graph[_Node]) -> dict[Incomplete, float]: ...
+def subgraph_centrality(G: Graph[_Node], *, normalized: bool = False) -> dict[Incomplete, float]: ...
 @_dispatchable
 def communicability_betweenness_centrality(G: Graph[_Node]) -> dict[Incomplete, Incomplete]: ...
 @_dispatchable

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

@@ -1,14 +1,24 @@
 from _typeshed import Incomplete
-from collections.abc import Iterable
+from collections.abc import Generator, Iterable
 
-from networkx.classes.graph import Graph, _Node
+from networkx.classes.graph import Graph, _NBunch, _Node
 from networkx.utils.backends import _dispatchable
 
-__all__ = ["triangles", "average_clustering", "clustering", "transitivity", "square_clustering", "generalized_degree"]
+__all__ = [
+    "triangles",
+    "all_triangles",
+    "average_clustering",
+    "clustering",
+    "transitivity",
+    "square_clustering",
+    "generalized_degree",
+]
 
 @_dispatchable
 def triangles(G: Graph[_Node], nodes=None) -> int | dict[Incomplete, int]: ...
 @_dispatchable
+def all_triangles(G: Graph[_Node], nbunch: _NBunch[_Node] = None) -> Generator[tuple[Incomplete, Incomplete, Incomplete]]: ...
+@_dispatchable
 def average_clustering(
     G: Graph[_Node], nodes: Iterable[_Node] | None = None, weight: str | None = None, count_zeros: bool = True
 ) -> float: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/__init__.pyi

@@ -1,9 +1,9 @@
 from networkx.algorithms.community.asyn_fluid import *
+from networkx.algorithms.community.bipartitions import *
 from networkx.algorithms.community.centrality import *
 from networkx.algorithms.community.community_utils import *
 from networkx.algorithms.community.divisive import *
 from networkx.algorithms.community.kclique import *
-from networkx.algorithms.community.kernighan_lin import *
 from networkx.algorithms.community.label_propagation import *
 from networkx.algorithms.community.leiden import *
 from networkx.algorithms.community.local import *

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/community/bipartitions.pyi

@@ -0,0 +1,22 @@
+from _typeshed import Incomplete
+from collections.abc import Iterable
+
+from networkx.algorithms.shortest_paths.weighted import _WeightFunc
+from networkx.classes.graph import Graph, _Node
+from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
+
+__all__ = ["kernighan_lin_bisection", "spectral_modularity_bipartition", "greedy_node_swap_bipartition"]
+
+@_dispatchable
+def kernighan_lin_bisection(
+    G: Graph[_Node],
+    partition: tuple[Iterable[Incomplete], Iterable[Incomplete]] | None = None,
+    max_iter: int = 10,
+    weight: str | _WeightFunc[_Node] = "weight",
+    seed: int | RandomState | None = None,
+) -> tuple[set[Incomplete], set[Incomplete]]: ...
+def spectral_modularity_bipartition(G: Graph[_Node]) -> tuple[set[Incomplete], set[Incomplete]]: ...
+def greedy_node_swap_bipartition(
+    G: Graph[_Node], *, init_split: tuple[set[Incomplete], set[Incomplete]] | None = None, max_iter: int = 10
+) -> tuple[set[Incomplete], set[Incomplete]]: ...

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

@@ -1,4 +1,5 @@
-from _typeshed import Incomplete, SupportsGetItem
+from _typeshed import Incomplete
+from collections.abc import Mapping
 
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
@@ -8,13 +9,13 @@ __all__ = ["core_number", "k_core", "k_shell", "k_crust", "k_corona", "k_truss",
 @_dispatchable
 def core_number(G: Graph[_Node]) -> dict[Incomplete, Incomplete]: ...
 @_dispatchable
-def k_core(G: Graph[_Node], k: int | None = None, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
+def k_core(G: Graph[_Node], k: int | None = None, core_number: Mapping[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_shell(G: Graph[_Node], k: int | None = None, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
+def k_shell(G: Graph[_Node], k: int | None = None, core_number: Mapping[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_crust(G: Graph[_Node], k: int | None = None, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
+def k_crust(G: Graph[_Node], k: int | None = None, core_number: Mapping[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
-def k_corona(G: Graph[_Node], k: int, core_number: SupportsGetItem[Incomplete, Incomplete] | None = None): ...
+def k_corona(G: Graph[_Node], k: int | None, core_number: Mapping[Incomplete, Incomplete] | None = None): ...
 @_dispatchable
 def k_truss(G: Graph[_Node], k: int): ...
 @_dispatchable

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

@@ -21,7 +21,6 @@ __all__ = [
     "dag_longest_path",
     "dag_longest_path_length",
     "dag_to_branching",
-    "compute_v_structures",
 ]
 
 @_dispatchable
@@ -61,5 +60,3 @@ def dag_longest_path(
 def dag_longest_path_length(G: DiGraph[_Node], weight: str | None = "weight", default_weight: int | None = 1) -> int: ...
 @_dispatchable
 def dag_to_branching(G: DiGraph[_Node]) -> DiGraph[_Node]: ...
-@_dispatchable
-def compute_v_structures(G: DiGraph[_Node]) -> Generator[tuple[Incomplete, Incomplete, Incomplete]]: ...

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

@@ -9,8 +9,8 @@ __all__ = ["is_distance_regular", "is_strongly_regular", "intersection_array", "
 @_dispatchable
 def is_distance_regular(G: Graph[_Node]) -> bool: ...
 @_dispatchable
-def global_parameters(b, c) -> Generator[tuple[Incomplete, Incomplete, Incomplete]]: ...
+def global_parameters(b: list[Incomplete], c: list[Incomplete]) -> Generator[tuple[Incomplete, Incomplete, Incomplete]]: ...
 @_dispatchable
-def intersection_array(G: Graph[_Node]): ...
+def intersection_array(G: Graph[_Node]) -> tuple[list[Incomplete], list[Incomplete]]: ...
 @_dispatchable
 def is_strongly_regular(G: Graph[_Node]) -> bool: ...

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

@@ -1,18 +1,31 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Callable, Generator, Hashable, Iterable
+from typing import Any
 
 __all__ = ["ISMAGS"]
 
+def are_all_equal(iterable: Iterable[Any]) -> bool: ...
+def make_partition(
+    items: Iterable[Hashable], test: Callable[[Hashable, Hashable], bool], check: bool = True
+) -> list[set[Incomplete]]: ...
+def node_to_part_ID_dict(partition: Iterable[Iterable[Incomplete]]) -> dict[Incomplete, int]: ...
+def color_degree_by_node(G, n_colors, e_colors): ...
+
+class EdgeLookup:
+    edge_dict: Incomplete
+    def __init__(self, edge_dict) -> None: ...
+    def __getitem__(self, edge): ...
+    def items(self): ...
+
 class ISMAGS:
     graph: Incomplete
     subgraph: Incomplete
-    node_equality: Incomplete
-    edge_equality: Incomplete
 
     def __init__(self, graph, subgraph, node_match=None, edge_match=None, cache=None) -> None: ...
+    def create_aligned_partitions(self, thing_matcher, sg_things, g_things): ...
     def find_isomorphisms(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete, Incomplete]: ...
     def largest_common_subgraph(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete, None]: ...
-    def analyze_symmetry(self, graph, node_partitions, edge_colors): ...
+    def analyze_subgraph_symmetry(self) -> dict[Hashable, set[Hashable]]: ...
     def is_isomorphic(self, symmetry: bool = False) -> bool: ...
     def subgraph_is_isomorphic(self, symmetry: bool = False) -> bool: ...
     def isomorphisms_iter(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete, None]: ...

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

@@ -4,4 +4,4 @@ from networkx.utils.backends import _dispatchable
 __all__ = ["non_randomness"]
 
 @_dispatchable
-def non_randomness(G: Graph[_Node], k: int | None = None, weight: str | None = "weight"): ...
+def non_randomness(G: Graph[_Node], k: int | None = None, weight: str | None = "weight") -> tuple[float, float]: ...

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

@@ -0,0 +1,7 @@
+from networkx.classes.graph import Graph, _Node
+from networkx.utils.backends import _dispatchable
+
+__all__ = ["is_perfect_graph"]
+
+@_dispatchable
+def is_perfect_graph(G: Graph[_Node]) -> bool: ...

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

@@ -1,8 +1,9 @@
-from _typeshed import Incomplete
-from collections.abc import Generator, Mapping, MutableSet, Reversible
+from _typeshed import Incomplete, Unused
+from collections.abc import Generator, Iterable, Mapping, MutableSet, Reversible
+from typing import NoReturn
 
 from networkx.classes.digraph import DiGraph
-from networkx.classes.graph import Graph, _Node
+from networkx.classes.graph import Graph, _EdgePlus, _Node
 from networkx.utils.backends import _dispatchable
 
 __all__ = ["check_planarity", "is_planar", "PlanarEmbedding"]
@@ -87,6 +88,9 @@ class LRPlanarity:
     def sign(self, e): ...
     def sign_recursive(self, e): ...
 
+# NOTE: Graph subclasses relationships are so complex
+# we're only overriding methods that differ in signature from the base classes
+# to use inheritance to our advantage and reduce complexity
 class PlanarEmbedding(DiGraph[_Node]):
     def get_data(self) -> dict[_Node, list[_Node]]: ...
     def set_data(self, data: Mapping[_Node, Reversible[_Node]]) -> None: ...
@@ -101,4 +105,9 @@ class PlanarEmbedding(DiGraph[_Node]):
     def traverse_face(
         self, v: _Node, w: _Node, mark_half_edges: MutableSet[tuple[_Node, _Node]] | None = None
     ) -> list[_Node]: ...
-    def to_undirected(self, reciprocal: bool = False, as_view: bool = False) -> Graph[_Node]: ...  # type: ignore[override]
+    # Overriden in __init__ to always raise
+    def add_edge(self, u_of_edge: _Node, v_of_edge: _Node, **attr: Unused) -> NoReturn: ...
+    def add_edges_from(self, ebunch_to_add: Iterable[_EdgePlus[_Node]], **attr: Unused) -> NoReturn: ...
+    def add_weighted_edges_from(
+        self, ebunch_to_add: Iterable[tuple[_Node, _Node, float]], weight: str = "weight", **attr: Unused
+    ) -> NoReturn: ...

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

@@ -1,4 +1,4 @@
-from _typeshed import Incomplete, SupportsGetItem
+from _typeshed import Incomplete, SupportsItemAccess
 from collections.abc import Callable, Generator
 
 from networkx.classes.graph import Graph, _Node
@@ -12,6 +12,7 @@ __all__ = [
     "optimize_edit_paths",
     "simrank_similarity",
     "panther_similarity",
+    "panther_vector_similarity",
     "generate_random_paths",
 ]
 
@@ -93,15 +94,30 @@ def panther_similarity(
     path_length: int = 5,
     c: float = 0.5,
     delta: float = 0.1,
-    eps=None,
+    eps: float | None = None,
     weight: str | None = "weight",
+    seed: int | RandomState | None = None,
 ) -> dict[bytes, bytes]: ...
 @_dispatchable
+def panther_vector_similarity(
+    G: Graph[_Node],
+    source: _Node,
+    *,
+    D: int = 10,
+    k: int = 5,
+    path_length: int = 5,
+    c: float = 0.5,
+    delta: float = 0.1,
+    eps: float | None = None,
+    weight: str | None = "weight",
+    seed: int | RandomState | None = None,
+) -> dict[Incomplete, float]: ...
+@_dispatchable
 def generate_random_paths(
     G: Graph[_Node],
     sample_size: int,
     path_length: int = 5,
-    index_map: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    index_map: SupportsItemAccess[Incomplete, Incomplete] | None = None,
     weight: str | None = "weight",
     seed: int | RandomState | None = None,
     *,

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

@@ -37,4 +37,3 @@ def eigenvalues(creation_sequence): ...
 def random_threshold_sequence(n, p, seed: int | RandomState | None = None): ...
 def right_d_threshold_sequence(n: int, m: int) -> list[str]: ...
 def left_d_threshold_sequence(n: int, m: int) -> list[str]: ...
-def swap_d(cs, p_split=1.0, p_combine=1.0, seed: int | RandomState | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/tree/__init__.pyi

@@ -1,6 +1,7 @@
 from .branchings import *
 from .coding import *
 from .decomposition import *
+from .distance_measures import *
 from .mst import *
 from .operations import *
 from .recognition import *

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

@@ -0,0 +1,10 @@
+from _typeshed import Incomplete
+
+from networkx.classes.graph import Graph, _Node
+from networkx.utils.backends import _dispatchable
+
+__all__ = ["center", "centroid"]
+
+def center(G: Graph[_Node]) -> list[Incomplete]: ...
+@_dispatchable
+def centroid(G: Graph[_Node]) -> list[Incomplete]: ...

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

@@ -1,7 +1,7 @@
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
-__all__ = ["wiener_index", "schultz_index", "gutman_index"]
+__all__ = ["wiener_index", "schultz_index", "gutman_index", "hyper_wiener_index"]
 
 @_dispatchable
 def wiener_index(G: Graph[_Node], weight: str | None = None) -> float: ...
@@ -9,3 +9,5 @@ def wiener_index(G: Graph[_Node], weight: str | None = None) -> float: ...
 def schultz_index(G: Graph[_Node], weight=None) -> float: ...
 @_dispatchable
 def gutman_index(G: Graph[_Node], weight=None) -> float: ...
+@_dispatchable
+def hyper_wiener_index(G: Graph[_Node], weight=None) -> float: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/digraph.pyi

@@ -10,6 +10,7 @@ from networkx.classes.reportviews import (
     InDegreeView,
     InEdgeView,
     InMultiDegreeView,
+    InMultiEdgeView,
     OutDegreeView,
     OutEdgeView,
     OutMultiDegreeView,
@@ -17,6 +18,9 @@ from networkx.classes.reportviews import (
 
 __all__ = ["DiGraph"]
 
+# NOTE: Graph subclasses relationships are so complex
+# we're only overriding methods that differ in signature from the base classes
+# to use inheritance to our advantage and reduce complexity
 class DiGraph(Graph[_Node]):
     @cached_property
     def succ(self) -> AdjacencyView[_Node, _Node, dict[str, Any]]: ...
@@ -30,17 +34,19 @@ class DiGraph(Graph[_Node]):
 
     def predecessors(self, n: _Node) -> Iterator[_Node]: ...
     @cached_property
+    def edges(self) -> OutEdgeView[_Node]: ...
+    @cached_property
     def out_edges(self) -> OutEdgeView[_Node]: ...
     @cached_property
-    def in_edges(self) -> InEdgeView[_Node]: ...
+    # Including subtypes' possible return types for LSP
+    def in_edges(self) -> InEdgeView[_Node] | InMultiEdgeView[_Node]: ...
+    @cached_property
+    def degree(self) -> DiDegreeView[_Node]: ...
     @cached_property
+    # Including subtypes' possible return types for LSP
     def in_degree(self) -> InDegreeView[_Node] | InMultiDegreeView[_Node]: ...
     @cached_property
+    # Including subtypes' possible return types for LSP
     def out_degree(self) -> OutDegreeView[_Node] | OutMultiDegreeView[_Node]: ...
-    def to_undirected(self, reciprocal: bool = False, as_view: bool = False) -> Graph[_Node]: ...  # type: ignore[override]
-    # reciprocal : If True, only edges that appear in both directions ... will be kept in the undirected graph.
+    def to_undirected(self, reciprocal: bool = False, as_view: bool = False) -> Graph[_Node]: ...  # type: ignore[override] # Has an additional `reciprocal` keyword argument
     def reverse(self, copy: bool = True) -> Self: ...
-    @cached_property
-    def edges(self) -> OutEdgeView[_Node]: ...  # type: ignore[override] # An OutEdgeView of the DiGraph as G.edges or G.edges().
-    @cached_property
-    def degree(self) -> int | DiDegreeView[_Node]: ...  # type: ignore[override] # Returns DiDegreeView or int

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/function.pyi

@@ -1,5 +1,5 @@
 from _typeshed import Incomplete, SupportsItems, SupportsKeysAndGetItem, Unused
-from collections.abc import Generator, Hashable, Iterable, Iterator
+from collections.abc import Callable, Generator, Hashable, Iterable, Iterator
 from typing import Literal, TypeVar, overload
 
 from networkx import _dispatchable
@@ -48,6 +48,7 @@ __all__ = [
     "number_of_selfloops",
     "path_weight",
     "is_path",
+    "describe",
 ]
 
 _U = TypeVar("_U")
@@ -171,3 +172,4 @@ def selfloop_edges(
 def number_of_selfloops(G: Graph[Hashable]) -> int: ...
 def is_path(G: Graph[_Node], path: Iterable[Incomplete]) -> bool: ...
 def path_weight(G: Graph[_Node], path, weight) -> int: ...
+def describe(G: Graph[_Node], describe_hook: Callable[[Graph[_Node]], dict[str, Incomplete]] | None = None) -> None: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/graph.pyi

@@ -6,7 +6,7 @@ from typing_extensions import Self, TypeAlias
 import numpy
 from networkx.classes.coreviews import AdjacencyView, AtlasView
 from networkx.classes.digraph import DiGraph
-from networkx.classes.reportviews import DegreeView, EdgeView, NodeView
+from networkx.classes.reportviews import DegreeView, DiDegreeView, EdgeView, NodeView, OutEdgeView
 
 _Node = TypeVar("_Node", bound=Hashable)
 _NodeWithData: TypeAlias = tuple[_Node, dict[str, Any]]
@@ -41,6 +41,9 @@ class Graph(Collection[_Node]):
 
     def to_directed_class(self) -> type[DiGraph[_Node]]: ...
     def to_undirected_class(self) -> type[Graph[_Node]]: ...
+    # @_dispatchable adds `backend` argument, but this decorated is unsupported constructor type here
+    # and __init__() ignores this argument
+    def __new__(cls, *args, backend=None, **kwargs) -> Self: ...
     def __init__(self, incoming_graph_data: _Data[_Node] | None = None, **attr: Any) -> None: ...  # attr: key=value pairs
     @cached_property
     def adj(self) -> AdjacencyView[_Node, _Node, dict[str, Any]]: ...
@@ -49,10 +52,10 @@ class Graph(Collection[_Node]):
     def name(self) -> str: ...
     @name.setter
     def name(self, s: str) -> None: ...
-    def __getitem__(self, n: _Node) -> AtlasView[_Node, str, Any]: ...
     def __iter__(self) -> Iterator[_Node]: ...
     def __contains__(self, n: object) -> bool: ...
     def __len__(self) -> int: ...
+    def __getitem__(self, n: _Node) -> AtlasView[_Node, str, Any]: ...
     def add_node(self, node_for_adding: _Node, **attr: Any) -> None: ...  # attr: Set or change node attributes using key=value
     def add_nodes_from(self, nodes_for_adding: Iterable[_NodePlus[_Node]], **attr: Any) -> None: ...  # attr: key=value pairs
     def remove_node(self, n: _Node) -> None: ...
@@ -62,7 +65,8 @@ class Graph(Collection[_Node]):
     def number_of_nodes(self) -> int: ...
     def order(self) -> int: ...
     def has_node(self, n: _Node) -> bool: ...
-    def add_edge(self, u_of_edge: _Node, v_of_edge: _Node, **attr: Any) -> None: ...
+    # Including subtypes' possible return types for LSP
+    def add_edge(self, u_of_edge: _Node, v_of_edge: _Node, **attr: Any) -> Hashable | None: ...
     # attr: Edge data (or labels or objects) can be assigned using keyword arguments
     def add_edges_from(self, ebunch_to_add: Iterable[_EdgePlus[_Node]], **attr: Any) -> None: ...
     # attr: Edge data (or labels or objects) can be assigned using keyword arguments
@@ -81,12 +85,14 @@ class Graph(Collection[_Node]):
     def has_edge(self, u: _Node, v: _Node) -> bool: ...
     def neighbors(self, n: _Node) -> Iterator[_Node]: ...
     @cached_property
-    def edges(self) -> EdgeView[_Node]: ...
+    # Including subtypes' possible return types for LSP
+    def edges(self) -> EdgeView[_Node] | OutEdgeView[_Node]: ...
     def get_edge_data(self, u: _Node, v: _Node, default: Any = None) -> dict[str, Any]: ...
     # default:  any Python object
     def adjacency(self) -> Iterator[tuple[_Node, dict[_Node, dict[str, Any]]]]: ...
     @cached_property
-    def degree(self) -> int | DegreeView[_Node]: ...
+    # Including subtypes' possible return types for LSP
+    def degree(self) -> DegreeView[_Node] | DiDegreeView[_Node]: ...
     def clear(self) -> None: ...
     def clear_edges(self) -> None: ...
     def is_multigraph(self) -> bool: ...
@@ -94,7 +100,7 @@ class Graph(Collection[_Node]):
     def copy(self, as_view: bool = False) -> Self: ...
     def to_directed(self, as_view: bool = False) -> DiGraph[_Node]: ...
     def to_undirected(self, as_view: bool = False) -> Graph[_Node]: ...
-    def subgraph(self, nodes: Iterable[_Node]) -> Graph[_Node]: ...
+    def subgraph(self, nodes: _NBunch[_Node]) -> Graph[_Node]: ...
     def edge_subgraph(self, edges: Iterable[_Edge[_Node]]) -> Graph[_Node]: ...
     @overload
     def size(self, weight: None = None) -> int: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/multidigraph.pyi

@@ -3,11 +3,11 @@ from typing import Any
 
 from networkx.classes.coreviews import MultiAdjacencyView
 from networkx.classes.digraph import DiGraph
-from networkx.classes.graph import _EdgeWithData, _Node
+from networkx.classes.graph import _Node
 from networkx.classes.multigraph import MultiGraph
 from networkx.classes.reportviews import (
+    DiMultiDegreeView,
     InMultiDegreeView,
-    InMultiEdgeDataView,
     InMultiEdgeView,
     OutMultiDegreeView,
     OutMultiEdgeView,
@@ -15,23 +15,24 @@ from networkx.classes.reportviews import (
 
 __all__ = ["MultiDiGraph"]
 
+# NOTE: Graph subclasses relationships are so complex
+# we're only overriding methods that differ in signature from the base classes
+# to use inheritance to our advantage and reduce complexity
 class MultiDiGraph(MultiGraph[_Node], DiGraph[_Node]):
     @cached_property
     def succ(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Any]]: ...
     @cached_property
     def pred(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Any]]: ...
     @cached_property
-    def edges(self) -> OutMultiEdgeView[_Node]: ...  # type: ignore[override]
-    # Returns: OutMultiEdgeView
+    def edges(self) -> OutMultiEdgeView[_Node]: ...
     @cached_property
     def out_edges(self) -> OutMultiEdgeView[_Node]: ...
     @cached_property
-    def in_edges(self) -> InMultiEdgeView[_Node] | InMultiEdgeDataView[_Node, _EdgeWithData[_Node]]: ...  # type: ignore[override]
-    # Returns : InMultiEdgeView or InMultiEdgeDataView
+    def in_edges(self) -> InMultiEdgeView[_Node]: ...
+    @cached_property
+    def degree(self) -> DiMultiDegreeView[_Node]: ...
     @cached_property
     def in_degree(self) -> InMultiDegreeView[_Node]: ...
     @cached_property
     def out_degree(self) -> OutMultiDegreeView[_Node]: ...
-    def to_undirected(self, reciprocal: bool = False, as_view: bool = False) -> MultiGraph[_Node]: ...  # type: ignore[override]
-    def reverse(self, copy: bool = True) -> MultiDiGraph[_Node]: ...
-    def copy(self, as_view: bool = False) -> MultiDiGraph[_Node]: ...
+    def to_undirected(self, reciprocal: bool = False, as_view: bool = False) -> MultiGraph[_Node]: ...  # type: ignore[override] # Has an additional `reciprocal` keyword argument

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/multigraph.pyi

@@ -1,12 +1,12 @@
 from collections.abc import Hashable
 from functools import cached_property
 from typing import Any, ClassVar, overload
-from typing_extensions import TypeAlias, TypeVar
+from typing_extensions import Self, TypeAlias, TypeVar
 
 from networkx.classes.coreviews import MultiAdjacencyView
 from networkx.classes.graph import Graph, _MapFactory, _Node
 from networkx.classes.multidigraph import MultiDiGraph
-from networkx.classes.reportviews import MultiEdgeView
+from networkx.classes.reportviews import DiMultiDegreeView, MultiDegreeView, MultiEdgeView, OutMultiEdgeView
 
 _MultiEdge: TypeAlias = tuple[_Node, _Node, int]  # noqa: Y047
 
@@ -15,36 +15,46 @@ _KeyT = TypeVar("_KeyT", bound=Hashable)
 
 __all__ = ["MultiGraph"]
 
+# NOTE: Graph subclasses relationships are so complex
+# we're only overriding methods that differ in signature from the base classes
+# to use inheritance to our advantage and reduce complexity
 class MultiGraph(Graph[_Node]):
     edge_key_dict_factory: ClassVar[_MapFactory]
+    def to_directed_class(self) -> type[MultiDiGraph[_Node]]: ...
+    def to_undirected_class(self) -> type[MultiGraph[_Node]]: ...
+    # @_dispatchable adds `backend` argument, but this decorated is unsupported constructor type here
+    # and __init__() ignores this argument
+    def __new__(cls, *args, backend=None, **kwargs) -> Self: ...
     def __init__(self, incoming_graph_data=None, multigraph_input: bool | None = None, **attr: Any) -> None: ...
     @cached_property
     def adj(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Any]]: ...  # data can be any type
     def new_edge_key(self, u: _Node, v: _Node) -> int: ...
-    @overload  # type: ignore[override]  # Has an additional `key` keyword argument
+    # key : hashable identifier, optional (default=lowest unused integer)
+    @overload  # type: ignore[override] # More complex overload
     def add_edge(self, u_for_edge: _Node, v_for_edge: _Node, key: int | None = None, **attr: Any) -> int: ...
     @overload
     def add_edge(self, u_for_edge: _Node, v_for_edge: _Node, key: _KeyT, **attr: Any) -> _KeyT: ...
-    # key : hashable identifier, optional (default=lowest unused integer)
     def remove_edge(self, u: _Node, v: _Node, key: Hashable | None = None) -> None: ...
     def has_edge(self, u: _Node, v: _Node, key: Hashable | None = None) -> bool: ...
+    @cached_property
+    # Including subtypes' possible return types for LSP
+    def edges(self) -> MultiEdgeView[_Node] | OutMultiEdgeView[_Node]: ...
+    # key : hashable identifier, optional (default=None).
+    # default : any Python object (default=None). Value to return if the specific edge (u, v, key) is not found.
+    # Returns: The edge attribute dictionary.
     @overload  # type: ignore[override]
     def get_edge_data(
         self, u: _Node, v: _Node, key: Hashable, default: _DefaultT | None = None
     ) -> dict[str, Any] | _DefaultT: ...
-    # key : hashable identifier, optional (default=None).
-    # default : any Python object (default=None). Value to return if the specific edge (u, v, key) is not found.
-    # Returns: The edge attribute dictionary.
+    # default : any Python object (default=None). Value to return if there are no edges between u and v and no key is specified.
+    # Returns: A dictionary mapping edge keys to attribute dictionaries for each of those edges if no specific key is provided.
     @overload
     def get_edge_data(
         self, u: _Node, v: _Node, key: None = None, default: _DefaultT | None = None
     ) -> dict[Hashable, dict[str, Any] | _DefaultT]: ...
-    # default : any Python object (default=None). Value to return if there are no edges between u and v and no key is specified.
-    # Returns: A dictionary mapping edge keys to attribute dictionaries for each of those edges if no specific key is provided.
     def copy(self, as_view: bool = False) -> MultiGraph[_Node]: ...
+    @cached_property
+    # Including subtypes' possible return types for LSP
+    def degree(self) -> MultiDegreeView[_Node] | DiMultiDegreeView[_Node]: ...
     def to_directed(self, as_view: bool = False) -> MultiDiGraph[_Node]: ...
     def to_undirected(self, as_view: bool = False) -> MultiGraph[_Node]: ...
-    def number_of_edges(self, u: _Node | None = None, v: _Node | None = None) -> int: ...
-    @cached_property
-    def edges(self) -> MultiEdgeView[_Node]: ...  # type: ignore[override]
-    # Returns: MultiEdgeView

package/dist/typeshed-fallback/stubs/networkx/networkx/drawing/layout.pyi

@@ -141,7 +141,6 @@ def forceatlas2_layout(
     node_mass: Mapping[_Node, float] | None = None,
     node_size: Mapping[_Node, float] | None = None,
     weight: str | None = None,
-    dissuade_hubs: bool = False,
     linlog: bool = False,
     seed: Seed | None = None,
     dim: int = 2,

package/dist/typeshed-fallback/stubs/networkx/networkx/drawing/nx_pylab.pyi

@@ -110,6 +110,26 @@ def apply_matplotlib_colors(
     vmax: float | None = None,
     nodes: bool = True,
 ) -> None: ...
+
+class CurvedArrowTextBase:
+    arrow: FancyArrowPatch
+    label_pos: float
+    labels_horizontal: bool
+    ax: Axes
+    x: Incomplete
+    y: Incomplete
+    angle: Incomplete
+    def __init__(
+        self,
+        arrow: FancyArrowPatch,
+        *args,
+        label_pos: float = 0.5,
+        labels_horizontal: bool = False,
+        ax: Axes | None = None,
+        **kwargs,
+    ) -> None: ...
+    def draw(self, renderer) -> None: ...
+
 def display(
     G: _G,
     canvas: Axes | None = None,

package/dist/typeshed-fallback/stubs/networkx/networkx/generators/expanders.pyi

@@ -1,3 +1,5 @@
+from typing_extensions import deprecated
+
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
@@ -6,6 +8,7 @@ __all__ = [
     "chordal_cycle_graph",
     "paley_graph",
     "maybe_regular_expander",
+    "maybe_regular_expander_graph",
     "is_regular_expander",
     "random_regular_expander_graph",
 ]
@@ -17,7 +20,12 @@ def chordal_cycle_graph(p, create_using=None): ...
 @_dispatchable
 def paley_graph(p, create_using=None): ...
 @_dispatchable
-def maybe_regular_expander(n, d, *, create_using=None, max_tries=100, seed=None): ...
+def maybe_regular_expander_graph(n, d, *, create_using=None, max_tries: int = 100, seed=None): ...
+@deprecated(
+    "`maybe_regular_expander` is a deprecated alias for `maybe_regular_expander_graph`. "
+    "Use `maybe_regular_expander_graph` instead."
+)
+def maybe_regular_expander(n, d, *, create_using=None, max_tries: int = 100, seed=None): ...
 @_dispatchable
 def is_regular_expander(G: Graph[_Node], *, epsilon: float = 0) -> bool: ...
 @_dispatchable