Remove bare Incomplete annotations in third-party stubs (#11671)

stubs/networkx/networkx/algorithms/operators/binary.pyi

@@ -1,4 +1,3 @@
-from _typeshed import Incomplete
 from collections.abc import Hashable
 from typing import TypeVar
 
@@ -22,4 +21,4 @@ _Y = TypeVar("_Y", bound=Hashable, covariant=True)
 @_dispatch
 def compose(G: DiGraph[_X], H: DiGraph[_Y]) -> DiGraph[_X | _Y]: ...
 @_dispatch
-def union(G: DiGraph[_X], H: DiGraph[_Y], rename: Incomplete = ()) -> DiGraph[_X | _Y]: ...
+def union(G: DiGraph[_X], H: DiGraph[_Y], rename=()) -> DiGraph[_X | _Y]: ...

stubs/networkx/networkx/algorithms/planarity.pyi

@@ -23,7 +23,7 @@ class Interval:
 class ConflictPair:
     left: Incomplete
     right: Incomplete
-    def __init__(self, left: Incomplete = ..., right: Incomplete = ...) -> None: ...
+    def __init__(self, left=..., right=...) -> None: ...
     def swap(self) -> None: ...
     def lowest(self, planarity_state): ...
 

stubs/networkx/networkx/classes/graph.pyi

@@ -45,7 +45,7 @@ class Graph(Collection[_Node]):
     def __contains__(self, n: object) -> bool: ...
     def __len__(self) -> int: ...
     def add_node(self, node_for_adding: _Node, **attr) -> None: ...
-    def add_nodes_from(self, nodes_for_adding: Iterable[_NodePlus[_Node]], **attr: Incomplete) -> None: ...
+    def add_nodes_from(self, nodes_for_adding: Iterable[_NodePlus[_Node]], **attr) -> None: ...
     def remove_node(self, n: _Node) -> None: ...
     def remove_nodes_from(self, nodes: Iterable[_Node]) -> None: ...
     nodes: NodeView[_Node]
@@ -55,7 +55,7 @@ class Graph(Collection[_Node]):
     def add_edge(self, u_of_edge: _Node, v_of_edge: _Node, **attr) -> None: ...
     def add_edges_from(self, ebunch_to_add: Iterable[_EdgePlus[_Node]], **attr) -> None: ...
     def add_weighted_edges_from(
-        self, ebunch_to_add: Iterable[tuple[_Node, _Node, Incomplete]], weight: str = "weight", **attr: Incomplete
+        self, ebunch_to_add: Iterable[tuple[_Node, _Node, Incomplete]], weight: str = "weight", **attr
     ) -> None: ...
     def remove_edge(self, u: _Node, v: _Node) -> None: ...
     def remove_edges_from(self, ebunch: Iterable[_EdgePlus[_Node]]) -> None: ...
@@ -68,7 +68,7 @@ class Graph(Collection[_Node]):
     def has_edge(self, u: _Node, v: _Node) -> bool: ...
     def neighbors(self, n: _Node) -> Iterator[_Node]: ...
     edges: OutEdgeView[_Node]
-    def get_edge_data(self, u: _Node, v: _Node, default: Incomplete = None) -> Mapping[str, Incomplete]: ...
+    def get_edge_data(self, u: _Node, v: _Node, default: Incomplete | None = None) -> Mapping[str, Incomplete]: ...
     def adjacency(self) -> Iterator[tuple[_Node, Mapping[_Node, Mapping[str, Incomplete]]]]: ...
 
     degree: DiDegreeView[_Node]

stubs/networkx/networkx/classes/reportviews.pyi

@@ -15,13 +15,17 @@ class NodeView(Mapping[_Node, dict[str, Any]], AbstractSet[_Node]):
     def __getitem__(self, n: _Node) -> dict[str, Any]: ...
     def __contains__(self, n: object) -> bool: ...
     @overload
-    def __call__(self, data: Literal[False] = False, default: Incomplete = None) -> Iterator[_Node]: ...
+    def __call__(self, data: Literal[False] = False, default: Incomplete | None = None) -> Iterator[_Node]: ...
     @overload
-    def __call__(self, data: Literal[True] | str, default: Incomplete = None) -> Iterator[tuple[_Node, dict[str, Any]]]: ...
-    def data(self, data: bool | str = True, default: Incomplete = None) -> NodeDataView[_Node]: ...
+    def __call__(
+        self, data: Literal[True] | str, default: Incomplete | None = None
+    ) -> Iterator[tuple[_Node, dict[str, Any]]]: ...
+    def data(self, data: bool | str = True, default: Incomplete | None = None) -> NodeDataView[_Node]: ...
 
 class NodeDataView(AbstractSet[_Node]):
-    def __init__(self, nodedict: Mapping[str, Incomplete], data: bool | str = False, default: Incomplete = None) -> None: ...
+    def __init__(
+        self, nodedict: Mapping[str, Incomplete], data: bool | str = False, default: Incomplete | None = None
+    ) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[tuple[_Node, Incomplete]]: ...  # type: ignore[override]
     def __contains__(self, n: object) -> bool: ...

stubs/networkx/networkx/convert.pyi

@@ -20,7 +20,7 @@ def to_networkx_graph(
 @_dispatch
 def to_dict_of_lists(G: Graph[_Node], nodelist: None | Iterable[_Node] = None) -> dict[_Node, list[_Node]]: ...
 @_dispatch
-def from_dict_of_lists(d: dict[_Node, Iterable[_Node]], create_using: Incomplete | None = None) -> Incomplete: ...
+def from_dict_of_lists(d: dict[_Node, Iterable[_Node]], create_using: Incomplete | None = None): ...
 def to_dict_of_dicts(G, nodelist=None, edge_data=None) -> dict[Incomplete, Incomplete]: ...
 @_dispatch
 def from_dict_of_dicts(d, create_using=None, multigraph_input=False): ...