basedpyright 1.31.5 → 1.31.6

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

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

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

@@ -1,6 +1,7 @@
-from _typeshed import Incomplete, SupportsGetItem
-from collections.abc import Collection
+from collections.abc import Collection, Mapping
 
+import numpy as np
+from networkx._typing import Array2D
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
@@ -10,19 +11,19 @@ __all__ = ["pagerank", "google_matrix"]
 def pagerank(
     G: Graph[_Node],
     alpha: float | None = 0.85,
-    personalization: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    personalization: Mapping[_Node, float] | None = None,
     max_iter: int | None = 100,
     tol: float | None = 1e-06,
-    nstart: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    nstart: Mapping[_Node, float] | None = None,
     weight: str | None = "weight",
-    dangling: SupportsGetItem[Incomplete, Incomplete] | None = None,
-) -> dict[Incomplete, float]: ...
+    dangling: Mapping[_Node, float] | None = None,
+) -> dict[_Node, float]: ...
 @_dispatchable
 def google_matrix(
     G: Graph[_Node],
     alpha: float = 0.85,
-    personalization: SupportsGetItem[Incomplete, Incomplete] | None = None,
+    personalization: Mapping[_Node, float] | None = None,
     nodelist: Collection[_Node] | None = None,
     weight: str | None = "weight",
-    dangling: SupportsGetItem[Incomplete, Incomplete] | None = None,
-): ...
+    dangling: Mapping[_Node, float] | None = None,
+) -> Array2D[np.float64]: ...

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

@@ -34,6 +34,26 @@ class ConflictPair:
     def lowest(self, planarity_state): ...
 
 class LRPlanarity:
+    __slots__ = [
+        "G",
+        "roots",
+        "height",
+        "lowpt",
+        "lowpt2",
+        "nesting_depth",
+        "parent_edge",
+        "DG",
+        "adjs",
+        "ordered_adjs",
+        "ref",
+        "side",
+        "S",
+        "stack_bottom",
+        "lowpt_edge",
+        "left_ref",
+        "right_ref",
+        "embedding",
+    ]
     G: Incomplete
     roots: Incomplete
     height: Incomplete

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

@@ -1,5 +1,5 @@
 from _typeshed import Incomplete, SupportsGetItem
-from collections.abc import Callable, Collection, Generator
+from collections.abc import Callable, Collection, Generator, Iterable
 from typing import Any
 
 from networkx.classes.graph import Graph, _Node
@@ -10,10 +10,12 @@ __all__ = ["all_simple_paths", "is_simple_path", "shortest_simple_paths", "all_s
 @_dispatchable
 def is_simple_path(G: Graph[_Node], nodes: Collection[Incomplete]) -> bool: ...
 @_dispatchable
-def all_simple_paths(G: Graph[_Node], source: _Node, target, cutoff: int | None = None) -> Generator[list[_Node], None, None]: ...
+def all_simple_paths(
+    G: Graph[_Node], source: _Node, target: _Node | Iterable[_Node], cutoff: int | None = None
+) -> Generator[list[_Node]]: ...
 @_dispatchable
 def all_simple_edge_paths(
-    G: Graph[_Node], source: _Node, target, cutoff: int | None = None
+    G: Graph[_Node], source: _Node, target: _Node | Iterable[_Node], cutoff: int | None = None
 ) -> Generator[list[_Node] | list[tuple[_Node, _Node]], None, list[_Node] | None]: ...
 @_dispatchable
 def shortest_simple_paths(

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/beamsearch.pyi

@@ -1,4 +1,3 @@
-from _typeshed import Incomplete
 from collections.abc import Callable, Generator
 
 from networkx.classes.graph import Graph, _Node
@@ -8,5 +7,5 @@ __all__ = ["bfs_beam_edges"]
 
 @_dispatchable
 def bfs_beam_edges(
-    G: Graph[_Node], source: _Node, value: Callable[..., Incomplete], width: int | None = None
-) -> Generator[Incomplete, Incomplete, Incomplete]: ...
+    G: Graph[_Node], source: _Node, value: Callable[[_Node], float], width: int | None = None
+) -> Generator[tuple[_Node, _Node]]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/breadth_first_search.pyi

@@ -1,7 +1,7 @@
-from _typeshed import Incomplete
-from collections.abc import Callable, Generator
-from typing import Literal
+from collections.abc import Callable, Generator, Iterable, Iterator
+from typing import Final, Literal
 
+from networkx.classes.digraph import DiGraph
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
@@ -17,34 +17,50 @@ __all__ = [
 ]
 
 @_dispatchable
-def generic_bfs_edges(G, source, neighbors=None, depth_limit=None) -> Generator[tuple[Incomplete, Incomplete]]: ...
+def generic_bfs_edges(
+    G: Graph[_Node], source: _Node, neighbors: Callable[[_Node], Iterable[_Node]] | None = None, depth_limit: int | None = None
+) -> Generator[tuple[_Node, _Node]]: ...
 @_dispatchable
 def bfs_edges(
     G: Graph[_Node],
     source: _Node,
     reverse: bool | None = False,
-    depth_limit=None,
-    sort_neighbors: Callable[..., Incomplete] | None = None,
-) -> Generator[Incomplete, Incomplete, None]: ...
+    depth_limit: int | None = None,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[tuple[_Node, _Node]]: ...
 @_dispatchable
 def bfs_tree(
     G: Graph[_Node],
     source: _Node,
     reverse: bool | None = False,
-    depth_limit=None,
-    sort_neighbors: Callable[..., Incomplete] | None = None,
-): ...
+    depth_limit: int | None = None,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> DiGraph[_Node]: ...
 @_dispatchable
 def bfs_predecessors(
-    G: Graph[_Node], source: _Node, depth_limit=None, sort_neighbors: Callable[..., Incomplete] | None = None
-) -> Generator[Incomplete, None, None]: ...
+    G: Graph[_Node],
+    source: _Node,
+    depth_limit: int | None = None,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[tuple[_Node, _Node]]: ...
 @_dispatchable
 def bfs_successors(
-    G: Graph[_Node], source: _Node, depth_limit=None, sort_neighbors: Callable[..., Incomplete] | None = None
-) -> Generator[Incomplete, None, None]: ...
+    G: Graph[_Node],
+    source: _Node,
+    depth_limit: int | None = None,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[tuple[_Node, list[_Node]]]: ...
 @_dispatchable
-def bfs_layers(G: Graph[_Node], sources) -> Generator[Incomplete, None, None]: ...
+def bfs_layers(G: Graph[_Node], sources: _Node | Iterable[_Node]) -> Generator[list[_Node]]: ...
+
+REVERSE_EDGE: Final = "reverse"
+TREE_EDGE: Final = "tree"
+FORWARD_EDGE: Final = "forward"
+LEVEL_EDGE: Final = "level"
+
 @_dispatchable
-def bfs_labeled_edges(G, sources) -> Generator[tuple[Incomplete, Incomplete, Literal["tree", "level", "forward", "reverse"]]]: ...
+def bfs_labeled_edges(
+    G: Graph[_Node], sources: _Node | Iterable[_Node]
+) -> Generator[tuple[_Node, _Node, Literal["tree", "level", "forward", "reverse"]]]: ...
 @_dispatchable
-def descendants_at_distance(G: Graph[_Node], source, distance): ...
+def descendants_at_distance(G: Graph[_Node], source: _Node, distance: int) -> set[_Node]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/depth_first_search.pyi

@@ -1,6 +1,7 @@
-from _typeshed import Incomplete
-from collections.abc import Callable, Generator
+from collections.abc import Callable, Generator, Iterable, Iterator
+from typing import Literal
 
+from networkx.classes.digraph import DiGraph
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
@@ -16,29 +17,57 @@ __all__ = [
 
 @_dispatchable
 def dfs_edges(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-) -> Generator[tuple[_Node, _Node], None, None]: ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[tuple[_Node, _Node]]: ...
 @_dispatchable
 def dfs_tree(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-): ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> DiGraph[_Node]: ...
 @_dispatchable
 def dfs_predecessors(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-) -> dict[Incomplete, Incomplete]: ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> dict[_Node, _Node]: ...
 @_dispatchable
 def dfs_successors(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-) -> dict[Incomplete, list[Incomplete]]: ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> dict[_Node, list[_Node]]: ...
 @_dispatchable
 def dfs_postorder_nodes(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-): ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[_Node]: ...
 @_dispatchable
 def dfs_preorder_nodes(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-): ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[_Node]: ...
 @_dispatchable
 def dfs_labeled_edges(
-    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
-) -> None: ...
+    G: Graph[_Node],
+    source: _Node | None = None,
+    depth_limit: int | None = None,
+    *,
+    sort_neighbors: Callable[[Iterator[_Node]], Iterable[_Node]] | None = None,
+) -> Generator[tuple[_Node, _Node, Literal["forward", "nontree", "reverse", "reverse-depth_limit"]]]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/edgebfs.pyi

@@ -1,6 +1,6 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
-from typing import Final
+from collections.abc import Generator, Iterable
+from typing import Final, Literal
 
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
@@ -11,4 +11,8 @@ FORWARD: Final = "forward"
 REVERSE: Final = "reverse"
 
 @_dispatchable
-def edge_bfs(G: Graph[_Node], source=None, orientation=None) -> Generator[Incomplete, None, None]: ...
+def edge_bfs(
+    G: Graph[_Node],
+    source: _Node | Iterable[_Node] | None = None,
+    orientation: Literal["original", "reverse", "ignore"] | None = None,
+) -> Generator[tuple[Incomplete, ...]]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/edgedfs.pyi

@@ -1,6 +1,6 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
-from typing import Final
+from collections.abc import Generator, Iterable
+from typing import Final, Literal
 
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
@@ -11,4 +11,8 @@ FORWARD: Final = "forward"
 REVERSE: Final = "reverse"
 
 @_dispatchable
-def edge_dfs(G: Graph[_Node], source=None, orientation=None) -> Generator[Incomplete, None, None]: ...
+def edge_dfs(
+    G: Graph[_Node],
+    source: _Node | Iterable[_Node] | None = None,
+    orientation: Literal["original", "reverse", "ignore"] | None = None,
+) -> Generator[tuple[Incomplete, ...]]: ...

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

@@ -21,6 +21,7 @@ __all__ = [
 ]
 
 class AtlasView(Mapping[_T, dict[_U, _V]]):
+    __slots__ = ("_atlas",)
     def __getstate__(self) -> dict[str, Mapping[_T, dict[_U, _V]]]: ...
     def __setstate__(self, state: dict[str, Mapping[_T, dict[_U, _V]]]) -> None: ...
     def __init__(self, d: Mapping[_T, dict[_U, _V]]) -> None: ...
@@ -29,10 +30,14 @@ class AtlasView(Mapping[_T, dict[_U, _V]]):
     def __getitem__(self, key: _T) -> dict[_U, _V]: ...
     def copy(self) -> dict[_T, dict[_U, _V]]: ...
 
-class AdjacencyView(AtlasView[_T, _U, _V]): ...
-class MultiAdjacencyView(AdjacencyView[_T, _U, _V]): ...
+class AdjacencyView(AtlasView[_T, _U, _V]):
+    __slots__ = ()
+
+class MultiAdjacencyView(AdjacencyView[_T, _U, _V]):
+    __slots__ = ()
 
 class UnionAtlas(Mapping[_T, dict[_U, _V]]):
+    __slots__ = ("_succ", "_pred")
     def __init__(self, succ: AtlasView[_T, _U, _V], pred: AtlasView[_T, _U, _V]) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[_T]: ...
@@ -40,14 +45,18 @@ class UnionAtlas(Mapping[_T, dict[_U, _V]]):
     def copy(self) -> Self: ...
 
 class UnionAdjacency(Mapping[_T, dict[_U, _V]]):
+    __slots__ = ("_succ", "_pred")
     def __init__(self, succ: AdjacencyView[_T, _U, _V], pred: AdjacencyView[_T, _U, _V]) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[_T]: ...
     def __getitem__(self, key: _T) -> dict[_U, _V]: ...
     def copy(self) -> Self: ...
 
-class UnionMultiInner(UnionAtlas[_T, _U, _V]): ...
-class UnionMultiAdjacency(UnionAdjacency[_T, _U, _V]): ...
+class UnionMultiInner(UnionAtlas[_T, _U, _V]):
+    __slots__ = ()
+
+class UnionMultiAdjacency(UnionAdjacency[_T, _U, _V]):
+    __slots__ = ()
 
 class FilterAtlas(Mapping[_T, _U]):
     NODE_OK: Callable[[_T], bool]

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

@@ -1,32 +1,46 @@
-from _typeshed import Incomplete
 from collections.abc import Iterator
 from functools import cached_property
+from typing import Any
 from typing_extensions import Self
 
 from networkx.classes.coreviews import AdjacencyView
 from networkx.classes.graph import Graph, _Node
-from networkx.classes.reportviews import InDegreeView, InMultiDegreeView, OutDegreeView, OutEdgeView, OutMultiDegreeView
+from networkx.classes.reportviews import (
+    DiDegreeView,
+    InDegreeView,
+    InEdgeView,
+    InMultiDegreeView,
+    OutDegreeView,
+    OutEdgeView,
+    OutMultiDegreeView,
+)
 
 __all__ = ["DiGraph"]
 
 class DiGraph(Graph[_Node]):
     @cached_property
-    def succ(self) -> AdjacencyView[_Node, _Node, dict[str, Incomplete]]: ...
+    def succ(self) -> AdjacencyView[_Node, _Node, dict[str, Any]]: ...
     @cached_property
-    def pred(self) -> AdjacencyView[_Node, _Node, dict[str, Incomplete]]: ...
+    def pred(self) -> AdjacencyView[_Node, _Node, dict[str, Any]]: ...
     def has_successor(self, u: _Node, v: _Node) -> bool: ...
     def has_predecessor(self, u: _Node, v: _Node) -> bool: ...
     def successors(self, n: _Node) -> Iterator[_Node]: ...
+
     neighbors = successors
+
     def predecessors(self, n: _Node) -> Iterator[_Node]: ...
     @cached_property
     def out_edges(self) -> OutEdgeView[_Node]: ...
     @cached_property
-    def in_edges(self) -> OutEdgeView[_Node]: ...
+    def in_edges(self) -> InEdgeView[_Node]: ...
     @cached_property
-    def in_degree(self) -> InDegreeView[_Node] | InMultiDegreeView[_Node]: ...  # Include subtypes' possible return types
+    def in_degree(self) -> InDegreeView[_Node] | InMultiDegreeView[_Node]: ...
     @cached_property
-    def out_degree(self) -> OutDegreeView[_Node] | OutMultiDegreeView[_Node]: ...  # Include subtypes' possible return types
-    def to_undirected(self, reciprocal: bool = False, as_view: bool = False) -> Graph[_Node]: ...  # type: ignore[override]  # Has an additional `reciprocal` keyword argument
+    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 reverse(self, copy: bool = True) -> Self: ...
-    def copy(self, as_view: bool = False) -> DiGraph[_Node]: ...
+    @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/multidigraph.pyi

@@ -1,26 +1,33 @@
-from _typeshed import Incomplete
 from functools import cached_property
+from typing import Any
 
 from networkx.classes.coreviews import MultiAdjacencyView
 from networkx.classes.digraph import DiGraph
-from networkx.classes.graph import _Node
+from networkx.classes.graph import _EdgeWithData, _Node
 from networkx.classes.multigraph import MultiGraph
-from networkx.classes.reportviews import InMultiDegreeView, OutMultiDegreeView, OutMultiEdgeView
+from networkx.classes.reportviews import (
+    InMultiDegreeView,
+    InMultiEdgeDataView,
+    InMultiEdgeView,
+    OutMultiDegreeView,
+    OutMultiEdgeView,
+)
 
 __all__ = ["MultiDiGraph"]
 
 class MultiDiGraph(MultiGraph[_Node], DiGraph[_Node]):
     @cached_property
-    def succ(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Incomplete]]: ...
+    def succ(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Any]]: ...
     @cached_property
-    def pred(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Incomplete]]: ...
+    def pred(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Any]]: ...
     @cached_property
     def edges(self) -> OutMultiEdgeView[_Node]: ...  # type: ignore[override]
     # Returns: OutMultiEdgeView
     @cached_property
     def out_edges(self) -> OutMultiEdgeView[_Node]: ...
     @cached_property
-    def in_edges(self) -> OutMultiEdgeView[_Node]: ...
+    def in_edges(self) -> InMultiEdgeView[_Node] | InMultiEdgeDataView[_Node, _EdgeWithData[_Node]]: ...  # type: ignore[override]
+    # Returns : InMultiEdgeView or InMultiEdgeDataView
     @cached_property
     def in_degree(self) -> InMultiDegreeView[_Node]: ...
     @cached_property

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

@@ -35,18 +35,23 @@ __all__ = [
 ]
 
 class NodeView(Mapping[_Node, dict[str, Any]], AbstractSet[_Node]):
+    __slots__ = ("_nodes",)
     def __init__(self, graph: Graph[_Node]) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[_Node]: ...
     def __getitem__(self, n: _Node) -> dict[str, Any]: ...
     def __contains__(self, n: object) -> bool: ...
     @overload
-    def __call__(self, data: Literal[False] = False, default=None) -> Iterator[_Node]: ...
+    def __call__(self, data: Literal[False] = False, default=None) -> Self: ...
     @overload
-    def __call__(self, data: Literal[True] | str, default=None) -> Iterator[tuple[_Node, dict[str, Any]]]: ...
-    def data(self, data: bool | str = True, default=None) -> NodeDataView[_Node]: ...
+    def __call__(self, data: Literal[True] | str, default=None) -> NodeDataView[_Node]: ...
+    @overload
+    def data(self, data: Literal[False], default=None) -> Self: ...
+    @overload
+    def data(self, data: Literal[True] | str = True, default=None) -> NodeDataView[_Node]: ...
 
 class NodeDataView(AbstractSet[_Node]):
+    __slots__ = ("_nodes", "_data", "_default")
     def __init__(self, nodedict: Mapping[str, Incomplete], data: bool | str = False, default=None) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[tuple[_Node, Incomplete]]: ...  # type: ignore[override]
@@ -55,9 +60,12 @@ class NodeDataView(AbstractSet[_Node]):
 
 class DiDegreeView(Generic[_Node]):
     def __init__(self, G: Graph[_Node], nbunch: _NBunch[_Node] = None, weight: None | bool | str = None) -> None: ...
-    def __call__(self, nbunch: _NBunch[_Node] = None, weight: None | bool | str = None) -> int | DiDegreeView[_Node]: ...
-    def __getitem__(self, n: _Node) -> float: ...
-    def __iter__(self) -> Iterator[tuple[_Node, float]]: ...
+    @overload  # Use this overload first in case _Node=str, since `str` matches `Iterable[str]`
+    def __call__(self, nbunch: _Node, weight: None | bool | str = None) -> int: ...  # type: ignore[overload-overlap]
+    @overload
+    def __call__(self, nbunch: Iterable[_Node] | None = None, weight: None | bool | str = None) -> Self: ...
+    def __getitem__(self, n: _Node) -> int: ...
+    def __iter__(self) -> Iterator[tuple[_Node, int]]: ...
     def __len__(self) -> int: ...
 
 class DegreeView(DiDegreeView[_Node]): ...
@@ -70,24 +78,33 @@ class OutMultiDegreeView(DiDegreeView[_Node]): ...
 class EdgeViewABC(ABC): ...
 
 class OutEdgeDataView(EdgeViewABC, Generic[_Node, _D]):
+    __slots__ = ("_viewer", "_nbunch", "_data", "_default", "_adjdict", "_nodes_nbrs", "_report")
     def __init__(self, viewer, nbunch: _NBunch[_Node] = None, data: bool = False, *, default=None) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[_D]: ...
     def __contains__(self, e: _Edge[_Node]) -> bool: ...
 
-class EdgeDataView(OutEdgeDataView[_Node, _D]): ...
-class InEdgeDataView(OutEdgeDataView[_Node, _D]): ...
+class EdgeDataView(OutEdgeDataView[_Node, _D]):
+    __slots__ = ()
+
+class InEdgeDataView(OutEdgeDataView[_Node, _D]):
+    __slots__ = ()
 
 class OutMultiEdgeDataView(OutEdgeDataView[_Node, _D]):
+    __slots__ = ("keys",)
     keys: bool
     def __init__(
         self, viewer, nbunch: _NBunch[_Node] = None, data: bool = False, *, default=None, keys: bool = False
     ) -> None: ...
 
-class MultiEdgeDataView(OutEdgeDataView[_Node, _D]): ...
-class InMultiEdgeDataView(OutEdgeDataView[_Node, _D]): ...
+class MultiEdgeDataView(OutEdgeDataView[_Node, _D]):
+    __slots__ = ()
+
+class InMultiEdgeDataView(OutEdgeDataView[_Node, _D]):
+    __slots__ = ()
 
 class OutEdgeView(AbstractSet[Incomplete], Mapping[Incomplete, Incomplete], EdgeViewABC, Generic[_Node]):
+    __slots__ = ("_adjdict", "_graph", "_nodes_nbrs")
     def __init__(self, G: Graph[_Node]) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[tuple[_Node, _Node]]: ...
@@ -128,6 +145,7 @@ class OutEdgeView(AbstractSet[Incomplete], Mapping[Incomplete, Incomplete], Edge
     ) -> OutEdgeDataView[_Node, tuple[_Node, _Node, _U]]: ...
 
 class EdgeView(OutEdgeView[_Node]):
+    __slots__ = ()
     dataview = EdgeDataView
     # Have to override parent's overloads with the proper return type based on dataview
     @overload
@@ -164,6 +182,7 @@ class EdgeView(OutEdgeView[_Node]):
     ) -> EdgeDataView[_Node, tuple[_Node, _Node, _U]]: ...
 
 class InEdgeView(OutEdgeView[_Node]):
+    __slots__ = ()
     dataview = InEdgeDataView
     # Have to override parent's overloads with the proper return type based on dataview
     @overload
@@ -200,6 +219,7 @@ class InEdgeView(OutEdgeView[_Node]):
     ) -> InEdgeDataView[_Node, tuple[_Node, _Node, _U]]: ...
 
 class OutMultiEdgeView(OutEdgeView[_Node]):
+    __slots__ = ()
     def __iter__(self) -> Iterator[tuple[_Node, _Node, Incomplete]]: ...  # type: ignore[override]
     def __getitem__(self, e: tuple[_Node, _Node, Incomplete]) -> dict[str, Any]: ...  # type: ignore[override]
     dataview = OutMultiEdgeDataView
@@ -263,6 +283,7 @@ class OutMultiEdgeView(OutEdgeView[_Node]):
     ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, _U]]: ...
 
 class MultiEdgeView(OutMultiEdgeView[_Node]):
+    __slots__ = ()
     dataview = MultiEdgeDataView  # type: ignore[assignment]
     # Have to override parent's overloads with the proper return type based on dataview
     @overload  # type: ignore[override]  # Has an additional `keys` keyword argument
@@ -325,6 +346,7 @@ class MultiEdgeView(OutMultiEdgeView[_Node]):
     ) -> MultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, _U]]: ...
 
 class InMultiEdgeView(OutMultiEdgeView[_Node]):
+    __slots__ = ()
     dataview = InMultiEdgeDataView  # type: ignore[assignment]
     # Have to override parent's overloads with the proper return type based on dataview
     @overload  # type: ignore[override]