diff --git a/stubs/networkx/networkx/algorithms/boundary.pyi b/stubs/networkx/networkx/algorithms/boundary.pyi index 08fb92032..7cbec735e 100644 --- a/stubs/networkx/networkx/algorithms/boundary.pyi +++ b/stubs/networkx/networkx/algorithms/boundary.pyi @@ -15,7 +15,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node], None, None]: ... @overload def edge_boundary( @@ -24,7 +24,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]], None, None]: ... @overload def edge_boundary( @@ -33,7 +33,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]], None, None]: ... @overload def edge_boundary( @@ -60,7 +60,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node, int], None, None]: ... @overload def edge_boundary( @@ -69,7 +69,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node, int], None, None]: ... @overload def edge_boundary( @@ -78,7 +78,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]], None, None]: ... @overload def edge_boundary( @@ -87,7 +87,7 @@ def edge_boundary( nbunch2: Iterable[Incomplete] | None = None, data=False, keys: bool = False, - default: Incomplete | None = None, + default=None, ) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]], None, None]: ... @overload def edge_boundary( diff --git a/stubs/networkx/networkx/algorithms/centrality/flow_matrix.pyi b/stubs/networkx/networkx/algorithms/centrality/flow_matrix.pyi index 7b7f43908..b2cc13b14 100644 --- a/stubs/networkx/networkx/algorithms/centrality/flow_matrix.pyi +++ b/stubs/networkx/networkx/algorithms/centrality/flow_matrix.pyi @@ -4,7 +4,7 @@ from collections.abc import Generator from networkx.utils.backends import _dispatchable @_dispatchable -def flow_matrix_row(G, weight: Incomplete | None = None, dtype=..., solver: str = "lu") -> Generator[Incomplete, None, None]: ... +def flow_matrix_row(G, weight=None, dtype=..., solver: str = "lu") -> Generator[Incomplete, None, None]: ... class InverseLaplacian: dtype: Incomplete @@ -13,7 +13,7 @@ class InverseLaplacian: C: Incomplete L1: Incomplete - def __init__(self, L, width: Incomplete | None = None, dtype: Incomplete | None = None) -> None: ... + def __init__(self, L, width=None, dtype=None) -> None: ... def init_solver(self, L) -> None: ... def solve(self, r) -> None: ... def solve_inverse(self, r) -> None: ... diff --git a/stubs/networkx/networkx/algorithms/coloring/greedy_coloring.pyi b/stubs/networkx/networkx/algorithms/coloring/greedy_coloring.pyi index 0ce06b531..9b7943f13 100644 --- a/stubs/networkx/networkx/algorithms/coloring/greedy_coloring.pyi +++ b/stubs/networkx/networkx/algorithms/coloring/greedy_coloring.pyi @@ -19,7 +19,7 @@ __all__ = [ @_dispatchable def strategy_largest_first(G, colors): ... @_dispatchable -def strategy_random_sequential(G, colors, seed: Incomplete | None = None): ... +def strategy_random_sequential(G, colors, seed=None): ... @_dispatchable def strategy_smallest_last(G, colors): ... @_dispatchable diff --git a/stubs/networkx/networkx/algorithms/isomorphism/ismags.pyi b/stubs/networkx/networkx/algorithms/isomorphism/ismags.pyi index e0dae00bd..1a3866cdc 100644 --- a/stubs/networkx/networkx/algorithms/isomorphism/ismags.pyi +++ b/stubs/networkx/networkx/algorithms/isomorphism/ismags.pyi @@ -9,14 +9,7 @@ class ISMAGS: node_equality: Incomplete edge_equality: Incomplete - def __init__( - self, - graph, - subgraph, - node_match: Incomplete | None = None, - edge_match: Incomplete | None = None, - cache: Incomplete | None = None, - ) -> None: ... + def __init__(self, graph, subgraph, node_match=None, edge_match=None, cache=None) -> None: ... 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): ... diff --git a/stubs/networkx/networkx/algorithms/isomorphism/isomorphvf2.pyi b/stubs/networkx/networkx/algorithms/isomorphism/isomorphvf2.pyi index dd57778fc..59aa12d82 100644 --- a/stubs/networkx/networkx/algorithms/isomorphism/isomorphvf2.pyi +++ b/stubs/networkx/networkx/algorithms/isomorphism/isomorphvf2.pyi @@ -54,7 +54,7 @@ class GMState: G2_node: Incomplete depth: Incomplete - def __init__(self, GM, G1_node: Incomplete | None = None, G2_node: Incomplete | None = None) -> None: ... + def __init__(self, GM, G1_node=None, G2_node=None) -> None: ... def restore(self) -> None: ... class DiGMState: @@ -63,5 +63,5 @@ class DiGMState: G2_node: Incomplete depth: Incomplete - def __init__(self, GM, G1_node: Incomplete | None = None, G2_node: Incomplete | None = None) -> None: ... + def __init__(self, GM, G1_node=None, G2_node=None) -> None: ... def restore(self) -> None: ... diff --git a/stubs/networkx/networkx/algorithms/isomorphism/temporalisomorphvf2.pyi b/stubs/networkx/networkx/algorithms/isomorphism/temporalisomorphvf2.pyi index 060f3d193..7ab32a2ab 100644 --- a/stubs/networkx/networkx/algorithms/isomorphism/temporalisomorphvf2.pyi +++ b/stubs/networkx/networkx/algorithms/isomorphism/temporalisomorphvf2.pyi @@ -23,8 +23,8 @@ class TimeRespectingDiGraphMatcher(DiGraphMatcher): def one_hop(self, Gx, Gx_node, core_x, pred, succ): ... def two_hop_pred(self, Gx, Gx_node, core_x, pred): ... def two_hop_succ(self, Gx, Gx_node, core_x, succ): ... - def preds(self, Gx, core_x, v, Gx_node: Incomplete | None = None): ... - def succs(self, Gx, core_x, v, Gx_node: Incomplete | None = None): ... + def preds(self, Gx, core_x, v, Gx_node=None): ... + def succs(self, Gx, core_x, v, Gx_node=None): ... def test_one(self, pred_dates, succ_dates): ... def test_two(self, pred_dates, succ_dates): ... def semantic_feasibility(self, G1_node, G2_node): ... diff --git a/stubs/networkx/networkx/algorithms/isomorphism/vf2userfunc.pyi b/stubs/networkx/networkx/algorithms/isomorphism/vf2userfunc.pyi index 3800601bc..475020aa5 100644 --- a/stubs/networkx/networkx/algorithms/isomorphism/vf2userfunc.pyi +++ b/stubs/networkx/networkx/algorithms/isomorphism/vf2userfunc.pyi @@ -10,7 +10,7 @@ class GraphMatcher(vf2.GraphMatcher): G1_adj: Incomplete G2_adj: Incomplete - def __init__(self, G1, G2, node_match: Incomplete | None = None, edge_match: Incomplete | None = None) -> None: ... + def __init__(self, G1, G2, node_match=None, edge_match=None) -> None: ... semantic_feasibility: Incomplete class DiGraphMatcher(vf2.DiGraphMatcher): @@ -19,7 +19,7 @@ class DiGraphMatcher(vf2.DiGraphMatcher): G1_adj: Incomplete G2_adj: Incomplete - def __init__(self, G1, G2, node_match: Incomplete | None = None, edge_match: Incomplete | None = None) -> None: ... + def __init__(self, G1, G2, node_match=None, edge_match=None) -> None: ... def semantic_feasibility(self, G1_node, G2_node): ... class MultiGraphMatcher(GraphMatcher): ... diff --git a/stubs/networkx/networkx/algorithms/lowest_common_ancestors.pyi b/stubs/networkx/networkx/algorithms/lowest_common_ancestors.pyi index 480a56cfd..ab7a8e547 100644 --- a/stubs/networkx/networkx/algorithms/lowest_common_ancestors.pyi +++ b/stubs/networkx/networkx/algorithms/lowest_common_ancestors.pyi @@ -10,7 +10,7 @@ __all__ = ["all_pairs_lowest_common_ancestor", "tree_all_pairs_lowest_common_anc @_dispatchable def all_pairs_lowest_common_ancestor(G: DiGraph[_Node], pairs=None): ... @_dispatchable -def lowest_common_ancestor(G: DiGraph[_Node], node1, node2, default: Incomplete | None = None): ... +def lowest_common_ancestor(G: DiGraph[_Node], node1, node2, default=None): ... @_dispatchable def tree_all_pairs_lowest_common_ancestor( G: DiGraph[_Node], root: _Node | None = None, pairs=None diff --git a/stubs/networkx/networkx/algorithms/planarity.pyi b/stubs/networkx/networkx/algorithms/planarity.pyi index 43d10d50a..4aae6dfb9 100644 --- a/stubs/networkx/networkx/algorithms/planarity.pyi +++ b/stubs/networkx/networkx/algorithms/planarity.pyi @@ -16,7 +16,7 @@ class Interval: low: Incomplete high: Incomplete - def __init__(self, low: Incomplete | None = None, high: Incomplete | None = None) -> None: ... + def __init__(self, low=None, high=None) -> None: ... def empty(self): ... def copy(self): ... def conflicting(self, b, planarity_state): ... diff --git a/stubs/networkx/networkx/algorithms/tree/branchings.pyi b/stubs/networkx/networkx/algorithms/tree/branchings.pyi index bc07c60e0..4232605cf 100644 --- a/stubs/networkx/networkx/algorithms/tree/branchings.pyi +++ b/stubs/networkx/networkx/algorithms/tree/branchings.pyi @@ -57,7 +57,7 @@ class ArborescenceIterator: partition_key: str init_partition: Incomplete - def __init__(self, G, weight: str = "weight", minimum: bool = True, init_partition: Incomplete | None = None) -> None: ... + def __init__(self, G, weight: str = "weight", minimum: bool = True, init_partition=None) -> None: ... partition_queue: Incomplete def __iter__(self) -> Iterator[Incomplete]: ... diff --git a/stubs/networkx/networkx/algorithms/vitality.pyi b/stubs/networkx/networkx/algorithms/vitality.pyi index a9b84a11c..1d5af2c99 100644 --- a/stubs/networkx/networkx/algorithms/vitality.pyi +++ b/stubs/networkx/networkx/algorithms/vitality.pyi @@ -1,11 +1,7 @@ -from _typeshed import Incomplete - from networkx.classes.graph import Graph, _Node from networkx.utils.backends import _dispatchable __all__ = ["closeness_vitality"] @_dispatchable -def closeness_vitality( - G: Graph[_Node], node: Incomplete | None = None, weight: str | None = None, wiener_index: float | None = None -): ... +def closeness_vitality(G: Graph[_Node], node=None, weight: str | None = None, wiener_index: float | None = None): ... diff --git a/stubs/networkx/networkx/classes/function.pyi b/stubs/networkx/networkx/classes/function.pyi index aa2d8623a..4af232795 100644 --- a/stubs/networkx/networkx/classes/function.pyi +++ b/stubs/networkx/networkx/classes/function.pyi @@ -53,8 +53,8 @@ __all__ = [ _U = TypeVar("_U") def nodes(G): ... -def edges(G, nbunch: Incomplete | None = None): ... -def degree(G, nbunch: Incomplete | None = None, weight: Incomplete | None = None): ... +def edges(G, nbunch=None): ... +def degree(G, nbunch=None, weight=None): ... def neighbors(G, n): ... def number_of_nodes(G): ... def number_of_edges(G): ... diff --git a/stubs/networkx/networkx/classes/graph.pyi b/stubs/networkx/networkx/classes/graph.pyi index 0679630a9..557448a22 100644 --- a/stubs/networkx/networkx/classes/graph.pyi +++ b/stubs/networkx/networkx/classes/graph.pyi @@ -79,7 +79,7 @@ class Graph(Collection[_Node]): def neighbors(self, n: _Node) -> Iterator[_Node]: ... @cached_property def edges(self) -> OutEdgeView[_Node]: ... - def get_edge_data(self, u: _Node, v: _Node, default: Incomplete | None = None) -> Mapping[str, Incomplete]: ... + def get_edge_data(self, u: _Node, v: _Node, default=None) -> Mapping[str, Incomplete]: ... def adjacency(self) -> Iterator[tuple[_Node, Mapping[_Node, Mapping[str, Incomplete]]]]: ... @cached_property def degree(self) -> DiDegreeView[_Node]: ... diff --git a/stubs/networkx/networkx/classes/multigraph.pyi b/stubs/networkx/networkx/classes/multigraph.pyi index 1fce3b565..e5628285a 100644 --- a/stubs/networkx/networkx/classes/multigraph.pyi +++ b/stubs/networkx/networkx/classes/multigraph.pyi @@ -14,15 +14,15 @@ __all__ = ["MultiGraph"] class MultiGraph(Graph[_Node]): edge_key_dict_factory: ClassVar[_MapFactory] - def __init__(self, incoming_graph_data: Incomplete | None = None, multigraph_input: bool | None = None, **attr) -> None: ... + def __init__(self, incoming_graph_data=None, multigraph_input: bool | None = None, **attr) -> None: ... @cached_property def adj(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Incomplete]]: ... def new_edge_key(self, u: _Node, v: _Node) -> int: ... - def add_edge(self, u_for_edge, v_for_edge, key: Incomplete | None = None, **attr): ... # type: ignore[override] # Has an additional `key` keyword argument - def remove_edge(self, u, v, key: Incomplete | None = None): ... - def has_edge(self, u, v, key: Incomplete | None = None): ... + def add_edge(self, u_for_edge, v_for_edge, key=None, **attr): ... # type: ignore[override] # Has an additional `key` keyword argument + def remove_edge(self, u, v, key=None): ... + def has_edge(self, u, v, key=None): ... def get_edge_data( # type: ignore[override] # Has an additional `key` keyword argument - self, u, v, key: Incomplete | None = None, default: Incomplete | None = None + self, u, v, key=None, default=None ): ... def copy(self, as_view: bool = False) -> MultiGraph[_Node]: ... def to_directed(self, as_view: bool = False) -> MultiDiGraph[_Node]: ... diff --git a/stubs/networkx/networkx/classes/reportviews.pyi b/stubs/networkx/networkx/classes/reportviews.pyi index 0337ba24c..ff9078493 100644 --- a/stubs/networkx/networkx/classes/reportviews.pyi +++ b/stubs/networkx/networkx/classes/reportviews.pyi @@ -41,17 +41,13 @@ 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 = None) -> Iterator[_Node]: ... + def __call__(self, data: Literal[False] = False, default=None) -> Iterator[_Node]: ... @overload - 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]: ... + 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]: ... class NodeDataView(AbstractSet[_Node]): - def __init__( - self, nodedict: Mapping[str, Incomplete], data: bool | str = False, default: Incomplete | None = None - ) -> None: ... + 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] def __contains__(self, n: object) -> bool: ... @@ -74,9 +70,7 @@ class OutMultiDegreeView(DiDegreeView[_Node]): ... class EdgeViewABC(ABC): ... class OutEdgeDataView(EdgeViewABC, Generic[_Node, _D]): - def __init__( - self, viewer, nbunch: _NBunch[_Node] = None, data: bool = False, *, default: Incomplete | None = None - ) -> None: ... + 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: ... @@ -87,7 +81,7 @@ class InEdgeDataView(OutEdgeDataView[_Node, _D]): ... class OutMultiEdgeDataView(OutEdgeDataView[_Node, _D]): keys: bool def __init__( - self, viewer, nbunch: _NBunch[_Node] = None, data: bool = False, *, default: Incomplete | None = None, keys: bool = False + self, viewer, nbunch: _NBunch[_Node] = None, data: bool = False, *, default=None, keys: bool = False ) -> None: ... class MultiEdgeDataView(OutEdgeDataView[_Node, _D]): ... diff --git a/stubs/networkx/networkx/convert.pyi b/stubs/networkx/networkx/convert.pyi index a85a117a9..0f25eabff 100644 --- a/stubs/networkx/networkx/convert.pyi +++ b/stubs/networkx/networkx/convert.pyi @@ -20,7 +20,7 @@ def to_networkx_graph( @_dispatchable def to_dict_of_lists(G: Graph[_Node], nodelist: Collection[_Node] | None = None) -> dict[_Node, list[_Node]]: ... @_dispatchable -def from_dict_of_lists(d: dict[_Node, Iterable[_Node]], create_using: Incomplete | None = None) -> Graph[_Node]: ... +def from_dict_of_lists(d: dict[_Node, Iterable[_Node]], create_using=None) -> Graph[_Node]: ... def to_dict_of_dicts( G: Graph[_Node], nodelist: Collection[_Node] | None = None, edge_data=None ) -> dict[Incomplete, Incomplete]: ... diff --git a/stubs/networkx/networkx/drawing/layout.pyi b/stubs/networkx/networkx/drawing/layout.pyi index fae316ed4..56bafec5d 100644 --- a/stubs/networkx/networkx/drawing/layout.pyi +++ b/stubs/networkx/networkx/drawing/layout.pyi @@ -21,55 +21,34 @@ __all__ = [ "arf_layout", ] -def random_layout(G, center: Incomplete | None = None, dim: int = 2, seed: Incomplete | None = None): ... -def circular_layout(G, scale: float = 1, center: Incomplete | None = None, dim: int = 2): ... -def shell_layout( - G, - nlist: Incomplete | None = None, - rotate: Incomplete | None = None, - scale: float = 1, - center: Incomplete | None = None, - dim: int = 2, -): ... -def bipartite_layout( - G, nodes, align: str = "vertical", scale: float = 1, center: Incomplete | None = None, aspect_ratio: float = ... -): ... +def random_layout(G, center=None, dim: int = 2, seed=None): ... +def circular_layout(G, scale: float = 1, center=None, dim: int = 2): ... +def shell_layout(G, nlist=None, rotate=None, scale: float = 1, center=None, dim: int = 2): ... +def bipartite_layout(G, nodes, align: str = "vertical", scale: float = 1, center=None, aspect_ratio: float = ...): ... def spring_layout( G, - k: Incomplete | None = None, - pos: Incomplete | None = None, - fixed: Incomplete | None = None, + k=None, + pos=None, + fixed=None, iterations: int = 50, threshold: float = 0.0001, weight: str = "weight", scale: float = 1, - center: Incomplete | None = None, + center=None, dim: int = 2, - seed: Incomplete | None = None, + seed=None, ): ... fruchterman_reingold_layout = spring_layout -def kamada_kawai_layout( - G, - dist: Incomplete | None = None, - pos: Incomplete | None = None, - weight: str = "weight", - scale: float = 1, - center: Incomplete | None = None, - dim: int = 2, -): ... -def spectral_layout(G, weight: str = "weight", scale: float = 1, center: Incomplete | None = None, dim: int = 2): ... -def planar_layout(G, scale: float = 1, center: Incomplete | None = None, dim: int = 2): ... -def spiral_layout( - G, scale: float = 1, center: Incomplete | None = None, dim: int = 2, resolution: float = 0.35, equidistant: bool = False -): ... -def multipartite_layout( - G, subset_key: str = "subset", align: str = "vertical", scale: float = 1, center: Incomplete | None = None -): ... +def kamada_kawai_layout(G, dist=None, pos=None, weight: str = "weight", scale: float = 1, center=None, dim: int = 2): ... +def spectral_layout(G, weight: str = "weight", scale: float = 1, center=None, dim: int = 2): ... +def planar_layout(G, scale: float = 1, center=None, dim: int = 2): ... +def spiral_layout(G, scale: float = 1, center=None, dim: int = 2, resolution: float = 0.35, equidistant: bool = False): ... +def multipartite_layout(G, subset_key: str = "subset", align: str = "vertical", scale: float = 1, center=None): ... def arf_layout( G, - pos: Incomplete | None = None, + pos=None, scaling: float = 1, a: float = 1.1, etol: float = 1e-06, diff --git a/stubs/networkx/networkx/drawing/nx_agraph.pyi b/stubs/networkx/networkx/drawing/nx_agraph.pyi index 0c744f10e..4082bd615 100644 --- a/stubs/networkx/networkx/drawing/nx_agraph.pyi +++ b/stubs/networkx/networkx/drawing/nx_agraph.pyi @@ -12,7 +12,7 @@ _AGraph: TypeAlias = Incomplete __all__ = ["from_agraph", "to_agraph", "write_dot", "read_dot", "graphviz_layout", "pygraphviz_layout", "view_pygraphviz"] @_dispatchable -def from_agraph(A, create_using: Incomplete | None = None) -> Graph[Incomplete]: ... +def from_agraph(A, create_using=None) -> Graph[Incomplete]: ... def to_agraph(N: Graph[Hashable]) -> _AGraph: ... def write_dot(G: Graph[Hashable], path: str | TextIOBase) -> None: ... @_dispatchable diff --git a/stubs/networkx/networkx/drawing/nx_latex.pyi b/stubs/networkx/networkx/drawing/nx_latex.pyi index a7ca26c18..1dcf1df0f 100644 --- a/stubs/networkx/networkx/drawing/nx_latex.pyi +++ b/stubs/networkx/networkx/drawing/nx_latex.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - __all__ = ["to_latex_raw", "to_latex", "write_latex"] def to_latex_raw( @@ -27,8 +25,8 @@ def to_latex( edge_label_options: str = "edge_label_options", caption: str = "", latex_label: str = "", - sub_captions: Incomplete | None = None, - sub_labels: Incomplete | None = None, + sub_captions=None, + sub_labels=None, n_rows: int = 1, as_document: bool = True, document_wrapper: str = ..., diff --git a/stubs/networkx/networkx/drawing/nx_pydot.pyi b/stubs/networkx/networkx/drawing/nx_pydot.pyi index dbb039f03..1a84f8d51 100644 --- a/stubs/networkx/networkx/drawing/nx_pydot.pyi +++ b/stubs/networkx/networkx/drawing/nx_pydot.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["write_dot", "read_dot", "graphviz_layout", "pydot_layout", "to_pydot", "from_pydot"] @@ -10,5 +8,5 @@ def read_dot(path): ... @_dispatchable def from_pydot(P): ... def to_pydot(N): ... -def graphviz_layout(G, prog: str = "neato", root: Incomplete | None = None): ... -def pydot_layout(G, prog: str = "neato", root: Incomplete | None = None): ... +def graphviz_layout(G, prog: str = "neato", root=None): ... +def pydot_layout(G, prog: str = "neato", root=None): ... diff --git a/stubs/networkx/networkx/drawing/nx_pylab.pyi b/stubs/networkx/networkx/drawing/nx_pylab.pyi index 9ed051b67..042f1e1dd 100644 --- a/stubs/networkx/networkx/drawing/nx_pylab.pyi +++ b/stubs/networkx/networkx/drawing/nx_pylab.pyi @@ -18,10 +18,8 @@ __all__ = [ "draw_forceatlas2", ] -def draw(G, pos: Incomplete | None = None, ax: Incomplete | None = None, **kwds) -> None: ... -def draw_networkx( - G, pos: Incomplete | None = None, arrows: Incomplete | None = None, with_labels: bool = True, **kwds -) -> None: ... +def draw(G, pos=None, ax=None, **kwds) -> None: ... +def draw_networkx(G, pos=None, arrows=None, with_labels: bool = True, **kwds) -> None: ... def draw_networkx_nodes( G, pos, @@ -29,33 +27,33 @@ def draw_networkx_nodes( node_size: Incomplete | int = 300, node_color: str = "#1f78b4", node_shape: str = "o", - alpha: Incomplete | None = None, - cmap: Incomplete | None = None, - vmin: Incomplete | None = None, - vmax: Incomplete | None = None, - ax: Incomplete | None = None, - linewidths: Incomplete | None = None, - edgecolors: Incomplete | None = None, - label: Incomplete | None = None, - margins: Incomplete | None = None, + alpha=None, + cmap=None, + vmin=None, + vmax=None, + ax=None, + linewidths=None, + edgecolors=None, + label=None, + margins=None, hide_ticks: bool = True, ): ... def draw_networkx_edges( G, pos, - edgelist: Incomplete | None = None, + edgelist=None, width: float = 1.0, edge_color: str = "k", style: str = "solid", - alpha: Incomplete | None = None, - arrowstyle: Incomplete | None = None, + alpha=None, + arrowstyle=None, arrowsize: int = 10, - edge_cmap: Incomplete | None = None, - edge_vmin: Incomplete | None = None, - edge_vmax: Incomplete | None = None, - ax: Incomplete | None = None, - arrows: Incomplete | None = None, - label: Incomplete | None = None, + edge_cmap=None, + edge_vmin=None, + edge_vmax=None, + ax=None, + arrows=None, + label=None, node_size: Incomplete | int = 300, nodelist: list[Incomplete] | None = None, node_shape: str = "o", @@ -67,33 +65,33 @@ def draw_networkx_edges( def draw_networkx_labels( G, pos, - labels: Incomplete | None = None, + labels=None, font_size: int = 12, font_color: str = "k", font_family: str = "sans-serif", font_weight: str = "normal", - alpha: Incomplete | None = None, - bbox: Incomplete | None = None, + alpha=None, + bbox=None, horizontalalignment: str = "center", verticalalignment: str = "center", - ax: Incomplete | None = None, + ax=None, clip_on: bool = True, hide_ticks: bool = True, ): ... def draw_networkx_edge_labels( G, pos, - edge_labels: Incomplete | None = None, + edge_labels=None, label_pos: float = 0.5, font_size: int = 10, font_color: str = "k", font_family: str = "sans-serif", font_weight: str = "normal", - alpha: Incomplete | None = None, - bbox: Incomplete | None = None, + alpha=None, + bbox=None, horizontalalignment: str = "center", verticalalignment: str = "center", - ax: Incomplete | None = None, + ax=None, rotate: bool = True, clip_on: bool = True, node_size: int = 300, @@ -106,6 +104,6 @@ def draw_kamada_kawai(G, **kwargs) -> None: ... def draw_random(G, **kwargs) -> None: ... def draw_spectral(G, **kwargs) -> None: ... def draw_spring(G, **kwargs) -> None: ... -def draw_shell(G, nlist: Incomplete | None = None, **kwargs) -> None: ... +def draw_shell(G, nlist=None, **kwargs) -> None: ... def draw_planar(G, **kwargs) -> None: ... def draw_forceatlas2(G, **kwargs) -> None: ... diff --git a/stubs/networkx/networkx/generators/classic.pyi b/stubs/networkx/networkx/generators/classic.pyi index 99b8a6d84..5c46ad3a2 100644 --- a/stubs/networkx/networkx/generators/classic.pyi +++ b/stubs/networkx/networkx/generators/classic.pyi @@ -28,44 +28,44 @@ __all__ = [ ] @_dispatchable -def full_rary_tree(r, n, create_using: Incomplete | None = None): ... +def full_rary_tree(r, n, create_using=None): ... @_dispatchable def kneser_graph(n, k) -> Graph[Incomplete]: ... @_dispatchable -def balanced_tree(r, h, create_using: Incomplete | None = None): ... +def balanced_tree(r, h, create_using=None): ... @_dispatchable -def barbell_graph(m1, m2, create_using: Incomplete | None = None): ... +def barbell_graph(m1, m2, create_using=None): ... @_dispatchable -def binomial_tree(n, create_using: Incomplete | None = None): ... +def binomial_tree(n, create_using=None): ... @_dispatchable -def complete_graph(n, create_using: Incomplete | None = None): ... +def complete_graph(n, create_using=None): ... @_dispatchable -def circular_ladder_graph(n, create_using: Incomplete | None = None): ... +def circular_ladder_graph(n, create_using=None): ... @_dispatchable -def circulant_graph(n, offsets, create_using: Incomplete | None = None): ... +def circulant_graph(n, offsets, create_using=None): ... @_dispatchable -def cycle_graph(n, create_using: Incomplete | None = None): ... +def cycle_graph(n, create_using=None): ... @_dispatchable -def dorogovtsev_goltsev_mendes_graph(n, create_using: Incomplete | None = None): ... +def dorogovtsev_goltsev_mendes_graph(n, create_using=None): ... @_dispatchable -def empty_graph(n: Incomplete | int = 0, create_using: Incomplete | None = None, default=...): ... +def empty_graph(n: Incomplete | int = 0, create_using=None, default=...): ... @_dispatchable -def ladder_graph(n, create_using: Incomplete | None = None): ... +def ladder_graph(n, create_using=None): ... @_dispatchable -def lollipop_graph(m, n, create_using: Incomplete | None = None): ... +def lollipop_graph(m, n, create_using=None): ... @_dispatchable -def null_graph(create_using: Incomplete | None = None): ... +def null_graph(create_using=None): ... @_dispatchable -def path_graph(n, create_using: Incomplete | None = None): ... +def path_graph(n, create_using=None): ... @_dispatchable -def star_graph(n, create_using: Incomplete | None = None): ... +def star_graph(n, create_using=None): ... @_dispatchable def tadpole_graph(m, n, create_using=None) -> Graph[Incomplete] | Incomplete: ... @_dispatchable -def trivial_graph(create_using: Incomplete | None = None): ... +def trivial_graph(create_using=None): ... @_dispatchable def turan_graph(n, r): ... @_dispatchable -def wheel_graph(n, create_using: Incomplete | None = None): ... +def wheel_graph(n, create_using=None): ... @_dispatchable def complete_multipartite_graph(*subset_sizes): ... diff --git a/stubs/networkx/networkx/generators/cographs.pyi b/stubs/networkx/networkx/generators/cographs.pyi index a3081cae6..ba2edca7a 100644 --- a/stubs/networkx/networkx/generators/cographs.pyi +++ b/stubs/networkx/networkx/generators/cographs.pyi @@ -1,8 +1,6 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["random_cograph"] @_dispatchable -def random_cograph(n, seed: Incomplete | None = None): ... +def random_cograph(n, seed=None): ... diff --git a/stubs/networkx/networkx/generators/community.pyi b/stubs/networkx/networkx/generators/community.pyi index d95c6eeee..706b03dbd 100644 --- a/stubs/networkx/networkx/generators/community.pyi +++ b/stubs/networkx/networkx/generators/community.pyi @@ -21,13 +21,13 @@ def caveman_graph(l, k): ... @_dispatchable def connected_caveman_graph(l, k): ... @_dispatchable -def relaxed_caveman_graph(l, k, p, seed: Incomplete | None = None): ... +def relaxed_caveman_graph(l, k, p, seed=None): ... @_dispatchable -def random_partition_graph(sizes, p_in, p_out, seed: Incomplete | None = None, directed: bool = False): ... +def random_partition_graph(sizes, p_in, p_out, seed=None, directed: bool = False): ... @_dispatchable -def planted_partition_graph(l, k, p_in, p_out, seed: Incomplete | None = None, directed: bool = False): ... +def planted_partition_graph(l, k, p_in, p_out, seed=None, directed: bool = False): ... @_dispatchable -def gaussian_random_partition_graph(n, s, v, p_in, p_out, directed: bool = False, seed: Incomplete | None = None): ... +def gaussian_random_partition_graph(n, s, v, p_in, p_out, directed: bool = False, seed=None): ... @_dispatchable def ring_of_cliques(num_cliques, clique_size): ... @_dispatchable @@ -37,7 +37,7 @@ def stochastic_block_model( sizes, p, nodelist: Collection[Incomplete] | None = None, - seed: Incomplete | None = None, + seed=None, directed: bool = False, selfloops: bool = False, sparse: bool = True, @@ -48,12 +48,12 @@ def LFR_benchmark_graph( tau1, tau2, mu, - average_degree: Incomplete | None = None, - min_degree: Incomplete | None = None, - max_degree: Incomplete | None = None, - min_community: Incomplete | None = None, - max_community: Incomplete | None = None, + average_degree=None, + min_degree=None, + max_degree=None, + min_community=None, + max_community=None, tol: float = 1e-07, max_iters: int = 500, - seed: Incomplete | None = None, + seed=None, ): ... diff --git a/stubs/networkx/networkx/generators/degree_seq.pyi b/stubs/networkx/networkx/generators/degree_seq.pyi index b24d74eea..325b6d911 100644 --- a/stubs/networkx/networkx/generators/degree_seq.pyi +++ b/stubs/networkx/networkx/generators/degree_seq.pyi @@ -13,21 +13,19 @@ __all__ = [ ] @_dispatchable -def configuration_model(deg_sequence, create_using: Incomplete | None = None, seed: Incomplete | None = None): ... +def configuration_model(deg_sequence, create_using=None, seed=None): ... @_dispatchable -def directed_configuration_model( - in_degree_sequence, out_degree_sequence, create_using: Incomplete | None = None, seed: Incomplete | None = None -): ... +def directed_configuration_model(in_degree_sequence, out_degree_sequence, create_using=None, seed=None): ... @_dispatchable -def expected_degree_graph(w, seed: Incomplete | None = None, selfloops: bool = True): ... +def expected_degree_graph(w, seed=None, selfloops: bool = True): ... @_dispatchable -def havel_hakimi_graph(deg_sequence, create_using: Incomplete | None = None): ... +def havel_hakimi_graph(deg_sequence, create_using=None): ... @_dispatchable -def directed_havel_hakimi_graph(in_deg_sequence, out_deg_sequence, create_using: Incomplete | None = None): ... +def directed_havel_hakimi_graph(in_deg_sequence, out_deg_sequence, create_using=None): ... @_dispatchable -def degree_sequence_tree(deg_sequence, create_using: Incomplete | None = None): ... +def degree_sequence_tree(deg_sequence, create_using=None): ... @_dispatchable -def random_degree_sequence_graph(sequence, seed: Incomplete | None = None, tries: int = 10): ... +def random_degree_sequence_graph(sequence, seed=None, tries: int = 10): ... class DegreeSequenceRandomGraph: rng: Incomplete @@ -38,7 +36,7 @@ class DegreeSequenceRandomGraph: remaining_degree: Incomplete graph: Incomplete def generate(self): ... - def update_remaining(self, u, v, aux_graph: Incomplete | None = None) -> None: ... + def update_remaining(self, u, v, aux_graph=None) -> None: ... def p(self, u, v): ... def q(self, u, v): ... def suitable_edge(self): ... diff --git a/stubs/networkx/networkx/generators/directed.pyi b/stubs/networkx/networkx/generators/directed.pyi index bb8f174dc..295a3cba3 100644 --- a/stubs/networkx/networkx/generators/directed.pyi +++ b/stubs/networkx/networkx/generators/directed.pyi @@ -1,15 +1,13 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["gn_graph", "gnc_graph", "gnr_graph", "random_k_out_graph", "scale_free_graph"] @_dispatchable -def gn_graph(n, kernel: Incomplete | None = None, create_using: Incomplete | None = None, seed: Incomplete | None = None): ... +def gn_graph(n, kernel=None, create_using=None, seed=None): ... @_dispatchable -def gnr_graph(n, p, create_using: Incomplete | None = None, seed: Incomplete | None = None): ... +def gnr_graph(n, p, create_using=None, seed=None): ... @_dispatchable -def gnc_graph(n, create_using: Incomplete | None = None, seed: Incomplete | None = None): ... +def gnc_graph(n, create_using=None, seed=None): ... @_dispatchable def scale_free_graph( n, @@ -18,9 +16,9 @@ def scale_free_graph( gamma: float = 0.05, delta_in: float = 0.2, delta_out: float = 0, - create_using: Incomplete | None = None, - seed: Incomplete | None = None, - initial_graph: Incomplete | None = None, + create_using=None, + seed=None, + initial_graph=None, ): ... @_dispatchable -def random_k_out_graph(n, k, alpha, self_loops: bool = True, seed: Incomplete | None = None): ... +def random_k_out_graph(n, k, alpha, self_loops: bool = True, seed=None): ... diff --git a/stubs/networkx/networkx/generators/duplication.pyi b/stubs/networkx/networkx/generators/duplication.pyi index 4b62c92c7..7371b6dc5 100644 --- a/stubs/networkx/networkx/generators/duplication.pyi +++ b/stubs/networkx/networkx/generators/duplication.pyi @@ -1,10 +1,8 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["partial_duplication_graph", "duplication_divergence_graph"] @_dispatchable -def partial_duplication_graph(N, n, p, q, seed: Incomplete | None = None): ... +def partial_duplication_graph(N, n, p, q, seed=None): ... @_dispatchable -def duplication_divergence_graph(n, p, seed: Incomplete | None = None): ... +def duplication_divergence_graph(n, p, seed=None): ... diff --git a/stubs/networkx/networkx/generators/ego.pyi b/stubs/networkx/networkx/generators/ego.pyi index 83725a552..188fa2374 100644 --- a/stubs/networkx/networkx/generators/ego.pyi +++ b/stubs/networkx/networkx/generators/ego.pyi @@ -1,8 +1,6 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["ego_graph"] @_dispatchable -def ego_graph(G, n, radius: float = 1, center: bool = True, undirected: bool = False, distance: Incomplete | None = None): ... +def ego_graph(G, n, radius: float = 1, center: bool = True, undirected: bool = False, distance=None): ... diff --git a/stubs/networkx/networkx/generators/expanders.pyi b/stubs/networkx/networkx/generators/expanders.pyi index f59596b79..6970592a3 100644 --- a/stubs/networkx/networkx/generators/expanders.pyi +++ b/stubs/networkx/networkx/generators/expanders.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = [ @@ -12,11 +10,11 @@ __all__ = [ ] @_dispatchable -def margulis_gabber_galil_graph(n, create_using: Incomplete | None = None): ... +def margulis_gabber_galil_graph(n, create_using=None): ... @_dispatchable -def chordal_cycle_graph(p, create_using: Incomplete | None = None): ... +def chordal_cycle_graph(p, create_using=None): ... @_dispatchable -def paley_graph(p, create_using: Incomplete | None = None): ... +def paley_graph(p, create_using=None): ... @_dispatchable def maybe_regular_expander(n, d, *, create_using=None, max_tries=100, seed=None): ... @_dispatchable diff --git a/stubs/networkx/networkx/generators/geometric.pyi b/stubs/networkx/networkx/generators/geometric.pyi index abaaba251..2147ac1b0 100644 --- a/stubs/networkx/networkx/generators/geometric.pyi +++ b/stubs/networkx/networkx/generators/geometric.pyi @@ -17,55 +17,19 @@ __all__ = [ @_dispatchable def geometric_edges(G, radius, p: float = 2): ... @_dispatchable -def random_geometric_graph( - n, radius, dim: int = 2, pos: Incomplete | None = None, p: float = 2, seed: Incomplete | None = None -): ... +def random_geometric_graph(n, radius, dim: int = 2, pos=None, p: float = 2, seed=None): ... @_dispatchable -def soft_random_geometric_graph( - n, - radius, - dim: int = 2, - pos: Incomplete | None = None, - p: float = 2, - p_dist: Incomplete | None = None, - seed: Incomplete | None = None, -): ... +def soft_random_geometric_graph(n, radius, dim: int = 2, pos=None, p: float = 2, p_dist=None, seed=None): ... @_dispatchable -def geographical_threshold_graph( - n, - theta, - dim: int = 2, - pos: Incomplete | None = None, - weight: Incomplete | None = None, - metric: Incomplete | None = None, - p_dist: Incomplete | None = None, - seed: Incomplete | None = None, -): ... +def geographical_threshold_graph(n, theta, dim: int = 2, pos=None, weight=None, metric=None, p_dist=None, seed=None): ... @_dispatchable -def waxman_graph( - n, - beta: float = 0.4, - alpha: float = 0.1, - L: Incomplete | None = None, - domain=(0, 0, 1, 1), - metric: Incomplete | None = None, - seed: Incomplete | None = None, -): ... +def waxman_graph(n, beta: float = 0.4, alpha: float = 0.1, L=None, domain=(0, 0, 1, 1), metric=None, seed=None): ... # docstring marks p as int, but it still works with floats. So I think it's better for consistency @_dispatchable -def navigable_small_world_graph(n, p: float = 1, q: int = 1, r: float = 2, dim: int = 2, seed: Incomplete | None = None): ... +def navigable_small_world_graph(n, p: float = 1, q: int = 1, r: float = 2, dim: int = 2, seed=None): ... @_dispatchable -def thresholded_random_geometric_graph( - n, - radius, - theta, - dim: int = 2, - pos: Incomplete | None = None, - weight: Incomplete | None = None, - p: float = 2, - seed: Incomplete | None = None, -): ... +def thresholded_random_geometric_graph(n, radius, theta, dim: int = 2, pos=None, weight=None, p: float = 2, seed=None): ... @_dispatchable def geometric_soft_configuration_graph( *, beta, n=None, gamma=None, mean_degree=None, kappas=None, seed=None diff --git a/stubs/networkx/networkx/generators/harary_graph.pyi b/stubs/networkx/networkx/generators/harary_graph.pyi index 341308b89..2f709f2c9 100644 --- a/stubs/networkx/networkx/generators/harary_graph.pyi +++ b/stubs/networkx/networkx/generators/harary_graph.pyi @@ -1,10 +1,8 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["hnm_harary_graph", "hkn_harary_graph"] @_dispatchable -def hnm_harary_graph(n, m, create_using: Incomplete | None = None): ... +def hnm_harary_graph(n, m, create_using=None): ... @_dispatchable -def hkn_harary_graph(k, n, create_using: Incomplete | None = None): ... +def hkn_harary_graph(k, n, create_using=None): ... diff --git a/stubs/networkx/networkx/generators/internet_as_graphs.pyi b/stubs/networkx/networkx/generators/internet_as_graphs.pyi index 8c9542f45..f951ee834 100644 --- a/stubs/networkx/networkx/generators/internet_as_graphs.pyi +++ b/stubs/networkx/networkx/generators/internet_as_graphs.pyi @@ -38,4 +38,4 @@ class AS_graph_generator: def generate(self): ... @_dispatchable -def random_internet_as_graph(n, seed: Incomplete | None = None): ... +def random_internet_as_graph(n, seed=None): ... diff --git a/stubs/networkx/networkx/generators/intersection.pyi b/stubs/networkx/networkx/generators/intersection.pyi index 73a5a7528..271deaec7 100644 --- a/stubs/networkx/networkx/generators/intersection.pyi +++ b/stubs/networkx/networkx/generators/intersection.pyi @@ -1,12 +1,10 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["uniform_random_intersection_graph", "k_random_intersection_graph", "general_random_intersection_graph"] @_dispatchable -def uniform_random_intersection_graph(n, m, p, seed: Incomplete | None = None): ... +def uniform_random_intersection_graph(n, m, p, seed=None): ... @_dispatchable -def k_random_intersection_graph(n, m, k, seed: Incomplete | None = None): ... +def k_random_intersection_graph(n, m, k, seed=None): ... @_dispatchable -def general_random_intersection_graph(n, m, p, seed: Incomplete | None = None): ... +def general_random_intersection_graph(n, m, p, seed=None): ... diff --git a/stubs/networkx/networkx/generators/joint_degree_seq.pyi b/stubs/networkx/networkx/generators/joint_degree_seq.pyi index b9f976ac3..98fea472a 100644 --- a/stubs/networkx/networkx/generators/joint_degree_seq.pyi +++ b/stubs/networkx/networkx/generators/joint_degree_seq.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["is_valid_joint_degree", "is_valid_directed_joint_degree", "joint_degree_graph", "directed_joint_degree_graph"] @@ -7,8 +5,8 @@ __all__ = ["is_valid_joint_degree", "is_valid_directed_joint_degree", "joint_deg @_dispatchable def is_valid_joint_degree(joint_degrees): ... @_dispatchable -def joint_degree_graph(joint_degrees, seed: Incomplete | None = None): ... +def joint_degree_graph(joint_degrees, seed=None): ... @_dispatchable def is_valid_directed_joint_degree(in_degrees, out_degrees, nkk): ... @_dispatchable -def directed_joint_degree_graph(in_degrees, out_degrees, nkk, seed: Incomplete | None = None): ... +def directed_joint_degree_graph(in_degrees, out_degrees, nkk, seed=None): ... diff --git a/stubs/networkx/networkx/generators/lattice.pyi b/stubs/networkx/networkx/generators/lattice.pyi index 29d8e5fa9..e82eb72ae 100644 --- a/stubs/networkx/networkx/generators/lattice.pyi +++ b/stubs/networkx/networkx/generators/lattice.pyi @@ -1,20 +1,14 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["grid_2d_graph", "grid_graph", "hypercube_graph", "triangular_lattice_graph", "hexagonal_lattice_graph"] @_dispatchable -def grid_2d_graph(m, n, periodic: bool = False, create_using: Incomplete | None = None): ... +def grid_2d_graph(m, n, periodic: bool = False, create_using=None): ... @_dispatchable def grid_graph(dim, periodic: bool = False): ... @_dispatchable def hypercube_graph(n): ... @_dispatchable -def triangular_lattice_graph( - m, n, periodic: bool = False, with_positions: bool = True, create_using: Incomplete | None = None -): ... +def triangular_lattice_graph(m, n, periodic: bool = False, with_positions: bool = True, create_using=None): ... @_dispatchable -def hexagonal_lattice_graph( - m, n, periodic: bool = False, with_positions: bool = True, create_using: Incomplete | None = None -): ... +def hexagonal_lattice_graph(m, n, periodic: bool = False, with_positions: bool = True, create_using=None): ... diff --git a/stubs/networkx/networkx/generators/line.pyi b/stubs/networkx/networkx/generators/line.pyi index 01a36dc83..84e0bf1d2 100644 --- a/stubs/networkx/networkx/generators/line.pyi +++ b/stubs/networkx/networkx/generators/line.pyi @@ -1,10 +1,8 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["line_graph", "inverse_line_graph"] @_dispatchable -def line_graph(G, create_using: Incomplete | None = None): ... +def line_graph(G, create_using=None): ... @_dispatchable def inverse_line_graph(G): ... diff --git a/stubs/networkx/networkx/generators/random_graphs.pyi b/stubs/networkx/networkx/generators/random_graphs.pyi index a0e78626e..958a5028e 100644 --- a/stubs/networkx/networkx/generators/random_graphs.pyi +++ b/stubs/networkx/networkx/generators/random_graphs.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = [ @@ -25,40 +23,40 @@ __all__ = [ ] @_dispatchable -def fast_gnp_random_graph(n, p, seed: Incomplete | None = None, directed: bool = False): ... +def fast_gnp_random_graph(n, p, seed=None, directed: bool = False): ... @_dispatchable -def gnp_random_graph(n, p, seed: Incomplete | None = None, directed: bool = False): ... +def gnp_random_graph(n, p, seed=None, directed: bool = False): ... binomial_graph = gnp_random_graph erdos_renyi_graph = gnp_random_graph @_dispatchable -def dense_gnm_random_graph(n, m, seed: Incomplete | None = None): ... +def dense_gnm_random_graph(n, m, seed=None): ... @_dispatchable -def gnm_random_graph(n, m, seed: Incomplete | None = None, directed: bool = False): ... +def gnm_random_graph(n, m, seed=None, directed: bool = False): ... @_dispatchable -def newman_watts_strogatz_graph(n, k, p, seed: Incomplete | None = None): ... +def newman_watts_strogatz_graph(n, k, p, seed=None): ... @_dispatchable -def watts_strogatz_graph(n, k, p, seed: Incomplete | None = None): ... +def watts_strogatz_graph(n, k, p, seed=None): ... @_dispatchable -def connected_watts_strogatz_graph(n, k, p, tries: int = 100, seed: Incomplete | None = None): ... +def connected_watts_strogatz_graph(n, k, p, tries: int = 100, seed=None): ... @_dispatchable -def random_regular_graph(d, n, seed: Incomplete | None = None): ... +def random_regular_graph(d, n, seed=None): ... @_dispatchable -def barabasi_albert_graph(n, m, seed: Incomplete | None = None, initial_graph: Incomplete | None = None): ... +def barabasi_albert_graph(n, m, seed=None, initial_graph=None): ... @_dispatchable -def dual_barabasi_albert_graph(n, m1, m2, p, seed: Incomplete | None = None, initial_graph: Incomplete | None = None): ... +def dual_barabasi_albert_graph(n, m1, m2, p, seed=None, initial_graph=None): ... @_dispatchable -def extended_barabasi_albert_graph(n, m, p, q, seed: Incomplete | None = None): ... +def extended_barabasi_albert_graph(n, m, p, q, seed=None): ... @_dispatchable -def powerlaw_cluster_graph(n, m, p, seed: Incomplete | None = None): ... +def powerlaw_cluster_graph(n, m, p, seed=None): ... @_dispatchable -def random_lobster(n, p1, p2, seed: Incomplete | None = None): ... +def random_lobster(n, p1, p2, seed=None): ... @_dispatchable -def random_shell_graph(constructor, seed: Incomplete | None = None): ... +def random_shell_graph(constructor, seed=None): ... @_dispatchable -def random_powerlaw_tree(n, gamma: float = 3, seed: Incomplete | None = None, tries: int = 100): ... +def random_powerlaw_tree(n, gamma: float = 3, seed=None, tries: int = 100): ... @_dispatchable -def random_powerlaw_tree_sequence(n, gamma: float = 3, seed: Incomplete | None = None, tries: int = 100): ... +def random_powerlaw_tree_sequence(n, gamma: float = 3, seed=None, tries: int = 100): ... @_dispatchable -def random_kernel_graph(n, kernel_integral, kernel_root: Incomplete | None = None, seed: Incomplete | None = None): ... +def random_kernel_graph(n, kernel_integral, kernel_root=None, seed=None): ... diff --git a/stubs/networkx/networkx/generators/small.pyi b/stubs/networkx/networkx/generators/small.pyi index 97c1057d8..4d5f7dc95 100644 --- a/stubs/networkx/networkx/generators/small.pyi +++ b/stubs/networkx/networkx/generators/small.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = [ @@ -29,48 +27,48 @@ __all__ = [ ] @_dispatchable -def LCF_graph(n, shift_list, repeats, create_using: Incomplete | None = None): ... +def LCF_graph(n, shift_list, repeats, create_using=None): ... @_dispatchable -def bull_graph(create_using: Incomplete | None = None): ... +def bull_graph(create_using=None): ... @_dispatchable -def chvatal_graph(create_using: Incomplete | None = None): ... +def chvatal_graph(create_using=None): ... @_dispatchable -def cubical_graph(create_using: Incomplete | None = None): ... +def cubical_graph(create_using=None): ... @_dispatchable -def desargues_graph(create_using: Incomplete | None = None): ... +def desargues_graph(create_using=None): ... @_dispatchable -def diamond_graph(create_using: Incomplete | None = None): ... +def diamond_graph(create_using=None): ... @_dispatchable -def dodecahedral_graph(create_using: Incomplete | None = None): ... +def dodecahedral_graph(create_using=None): ... @_dispatchable -def frucht_graph(create_using: Incomplete | None = None): ... +def frucht_graph(create_using=None): ... @_dispatchable -def heawood_graph(create_using: Incomplete | None = None): ... +def heawood_graph(create_using=None): ... @_dispatchable def hoffman_singleton_graph(): ... @_dispatchable -def house_graph(create_using: Incomplete | None = None): ... +def house_graph(create_using=None): ... @_dispatchable -def house_x_graph(create_using: Incomplete | None = None): ... +def house_x_graph(create_using=None): ... @_dispatchable -def icosahedral_graph(create_using: Incomplete | None = None): ... +def icosahedral_graph(create_using=None): ... @_dispatchable -def krackhardt_kite_graph(create_using: Incomplete | None = None): ... +def krackhardt_kite_graph(create_using=None): ... @_dispatchable -def moebius_kantor_graph(create_using: Incomplete | None = None): ... +def moebius_kantor_graph(create_using=None): ... @_dispatchable -def octahedral_graph(create_using: Incomplete | None = None): ... +def octahedral_graph(create_using=None): ... @_dispatchable def pappus_graph(): ... @_dispatchable -def petersen_graph(create_using: Incomplete | None = None): ... +def petersen_graph(create_using=None): ... @_dispatchable -def sedgewick_maze_graph(create_using: Incomplete | None = None): ... +def sedgewick_maze_graph(create_using=None): ... @_dispatchable -def tetrahedral_graph(create_using: Incomplete | None = None): ... +def tetrahedral_graph(create_using=None): ... @_dispatchable -def truncated_cube_graph(create_using: Incomplete | None = None): ... +def truncated_cube_graph(create_using=None): ... @_dispatchable -def truncated_tetrahedron_graph(create_using: Incomplete | None = None): ... +def truncated_tetrahedron_graph(create_using=None): ... @_dispatchable -def tutte_graph(create_using: Incomplete | None = None): ... +def tutte_graph(create_using=None): ... diff --git a/stubs/networkx/networkx/generators/spectral_graph_forge.pyi b/stubs/networkx/networkx/generators/spectral_graph_forge.pyi index 6fc6902a3..a4af66065 100644 --- a/stubs/networkx/networkx/generators/spectral_graph_forge.pyi +++ b/stubs/networkx/networkx/generators/spectral_graph_forge.pyi @@ -1,8 +1,6 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["spectral_graph_forge"] @_dispatchable -def spectral_graph_forge(G, alpha, transformation: str = "identity", seed: Incomplete | None = None): ... +def spectral_graph_forge(G, alpha, transformation: str = "identity", seed=None): ... diff --git a/stubs/networkx/networkx/lazy_imports.pyi b/stubs/networkx/networkx/lazy_imports.pyi index b932e90af..c5bc64e49 100644 --- a/stubs/networkx/networkx/lazy_imports.pyi +++ b/stubs/networkx/networkx/lazy_imports.pyi @@ -1,9 +1,8 @@ import types -from _typeshed import Incomplete __all__ = ["attach", "_lazy_import"] -def attach(module_name, submodules: Incomplete | None = None, submod_attrs: Incomplete | None = None): ... +def attach(module_name, submodules=None, submod_attrs=None): ... class DelayedImportErrorModule(types.ModuleType): def __init__(self, frame_data, *args, **kwargs) -> None: ... diff --git a/stubs/networkx/networkx/linalg/algebraicconnectivity.pyi b/stubs/networkx/networkx/linalg/algebraicconnectivity.pyi index fa12fa8c1..6e7403044 100644 --- a/stubs/networkx/networkx/linalg/algebraicconnectivity.pyi +++ b/stubs/networkx/networkx/linalg/algebraicconnectivity.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["algebraic_connectivity", "fiedler_vector", "spectral_ordering", "spectral_bisection"] @@ -10,41 +8,21 @@ class _PCGSolver: class _LUSolver: def __init__(self, A) -> None: ... - def solve(self, B, tol: Incomplete | None = None): ... + def solve(self, B, tol=None): ... @_dispatchable def algebraic_connectivity( - G, - weight: str = "weight", - normalized: bool = False, - tol: float = 1e-08, - method: str = "tracemin_pcg", - seed: Incomplete | None = None, + G, weight: str = "weight", normalized: bool = False, tol: float = 1e-08, method: str = "tracemin_pcg", seed=None ): ... @_dispatchable def fiedler_vector( - G, - weight: str = "weight", - normalized: bool = False, - tol: float = 1e-08, - method: str = "tracemin_pcg", - seed: Incomplete | None = None, + G, weight: str = "weight", normalized: bool = False, tol: float = 1e-08, method: str = "tracemin_pcg", seed=None ): ... @_dispatchable def spectral_ordering( - G, - weight: str = "weight", - normalized: bool = False, - tol: float = 1e-08, - method: str = "tracemin_pcg", - seed: Incomplete | None = None, + G, weight: str = "weight", normalized: bool = False, tol: float = 1e-08, method: str = "tracemin_pcg", seed=None ): ... @_dispatchable def spectral_bisection( - G, - weight: str = "weight", - normalized: bool = False, - tol: float = 1e-08, - method: str = "tracemin_pcg", - seed: Incomplete | None = None, + G, weight: str = "weight", normalized: bool = False, tol: float = 1e-08, method: str = "tracemin_pcg", seed=None ): ... diff --git a/stubs/networkx/networkx/linalg/attrmatrix.pyi b/stubs/networkx/networkx/linalg/attrmatrix.pyi index 3e645842e..01fba7355 100644 --- a/stubs/networkx/networkx/linalg/attrmatrix.pyi +++ b/stubs/networkx/networkx/linalg/attrmatrix.pyi @@ -1,25 +1,8 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["attr_matrix", "attr_sparse_matrix"] @_dispatchable -def attr_matrix( - G, - edge_attr: Incomplete | None = None, - node_attr: Incomplete | None = None, - normalized: bool = False, - rc_order: Incomplete | None = None, - dtype: Incomplete | None = None, - order: Incomplete | None = None, -): ... +def attr_matrix(G, edge_attr=None, node_attr=None, normalized: bool = False, rc_order=None, dtype=None, order=None): ... @_dispatchable -def attr_sparse_matrix( - G, - edge_attr: Incomplete | None = None, - node_attr: Incomplete | None = None, - normalized: bool = False, - rc_order: Incomplete | None = None, - dtype: Incomplete | None = None, -): ... +def attr_sparse_matrix(G, edge_attr=None, node_attr=None, normalized: bool = False, rc_order=None, dtype=None): ... diff --git a/stubs/networkx/networkx/linalg/bethehessianmatrix.pyi b/stubs/networkx/networkx/linalg/bethehessianmatrix.pyi index 2e98b1cdb..b2713db48 100644 --- a/stubs/networkx/networkx/linalg/bethehessianmatrix.pyi +++ b/stubs/networkx/networkx/linalg/bethehessianmatrix.pyi @@ -6,4 +6,4 @@ from networkx.utils.backends import _dispatchable __all__ = ["bethe_hessian_matrix"] @_dispatchable -def bethe_hessian_matrix(G, r: Incomplete | None = None, nodelist: Collection[Incomplete] | None = None): ... +def bethe_hessian_matrix(G, r=None, nodelist: Collection[Incomplete] | None = None): ... diff --git a/stubs/networkx/networkx/linalg/graphmatrix.pyi b/stubs/networkx/networkx/linalg/graphmatrix.pyi index 97fb7371c..d4277651b 100644 --- a/stubs/networkx/networkx/linalg/graphmatrix.pyi +++ b/stubs/networkx/networkx/linalg/graphmatrix.pyi @@ -6,14 +6,6 @@ from networkx.utils.backends import _dispatchable __all__ = ["incidence_matrix", "adjacency_matrix"] @_dispatchable -def incidence_matrix( - G, - nodelist: Collection[Incomplete] | None = None, - edgelist: Incomplete | None = None, - oriented: bool = False, - weight: Incomplete | None = None, -): ... +def incidence_matrix(G, nodelist: Collection[Incomplete] | None = None, edgelist=None, oriented: bool = False, weight=None): ... @_dispatchable -def adjacency_matrix( - G, nodelist: Collection[Incomplete] | None = None, dtype: Incomplete | None = None, weight: str = "weight" -): ... +def adjacency_matrix(G, nodelist: Collection[Incomplete] | None = None, dtype=None, weight: str = "weight"): ... diff --git a/stubs/networkx/networkx/linalg/laplacianmatrix.pyi b/stubs/networkx/networkx/linalg/laplacianmatrix.pyi index ebbfd8479..26eccdf28 100644 --- a/stubs/networkx/networkx/linalg/laplacianmatrix.pyi +++ b/stubs/networkx/networkx/linalg/laplacianmatrix.pyi @@ -16,20 +16,12 @@ def laplacian_matrix(G, nodelist: Collection[Incomplete] | None = None, weight: @_dispatchable def normalized_laplacian_matrix(G, nodelist: Collection[Incomplete] | None = None, weight: str = "weight"): ... @_dispatchable -def total_spanning_tree_weight(G, weight: Incomplete | None = None): ... +def total_spanning_tree_weight(G, weight=None): ... @_dispatchable def directed_laplacian_matrix( - G, - nodelist: Collection[Incomplete] | None = None, - weight: str = "weight", - walk_type: Incomplete | None = None, - alpha: float = 0.95, + G, nodelist: Collection[Incomplete] | None = None, weight: str = "weight", walk_type=None, alpha: float = 0.95 ): ... @_dispatchable def directed_combinatorial_laplacian_matrix( - G, - nodelist: Collection[Incomplete] | None = None, - weight: str = "weight", - walk_type: Incomplete | None = None, - alpha: float = 0.95, + G, nodelist: Collection[Incomplete] | None = None, weight: str = "weight", walk_type=None, alpha: float = 0.95 ): ... diff --git a/stubs/networkx/networkx/linalg/modularitymatrix.pyi b/stubs/networkx/networkx/linalg/modularitymatrix.pyi index 03b0e1ef1..c1f9be8d5 100644 --- a/stubs/networkx/networkx/linalg/modularitymatrix.pyi +++ b/stubs/networkx/networkx/linalg/modularitymatrix.pyi @@ -6,6 +6,6 @@ from networkx.utils.backends import _dispatchable __all__ = ["modularity_matrix", "directed_modularity_matrix"] @_dispatchable -def modularity_matrix(G, nodelist: Collection[Incomplete] | None = None, weight: Incomplete | None = None): ... +def modularity_matrix(G, nodelist: Collection[Incomplete] | None = None, weight=None): ... @_dispatchable -def directed_modularity_matrix(G, nodelist: Collection[Incomplete] | None = None, weight: Incomplete | None = None): ... +def directed_modularity_matrix(G, nodelist: Collection[Incomplete] | None = None, weight=None): ... diff --git a/stubs/networkx/networkx/linalg/spectrum.pyi b/stubs/networkx/networkx/linalg/spectrum.pyi index 3051a272c..c30aa5061 100644 --- a/stubs/networkx/networkx/linalg/spectrum.pyi +++ b/stubs/networkx/networkx/linalg/spectrum.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = [ @@ -19,4 +17,4 @@ def adjacency_spectrum(G, weight: str = "weight"): ... @_dispatchable def modularity_spectrum(G): ... @_dispatchable -def bethe_hessian_spectrum(G, r: Incomplete | None = None): ... +def bethe_hessian_spectrum(G, r=None): ... diff --git a/stubs/networkx/networkx/readwrite/adjlist.pyi b/stubs/networkx/networkx/readwrite/adjlist.pyi index b9cbfef32..2f482e88b 100644 --- a/stubs/networkx/networkx/readwrite/adjlist.pyi +++ b/stubs/networkx/networkx/readwrite/adjlist.pyi @@ -8,19 +8,6 @@ __all__ = ["generate_adjlist", "write_adjlist", "parse_adjlist", "read_adjlist"] def generate_adjlist(G, delimiter: str = " ") -> Generator[Incomplete, None, None]: ... def write_adjlist(G, path, comments: str = "#", delimiter: str = " ", encoding: str = "utf-8") -> None: ... @_dispatchable -def parse_adjlist( - lines, - comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, -): ... +def parse_adjlist(lines, comments: str = "#", delimiter=None, create_using=None, nodetype=None): ... @_dispatchable -def read_adjlist( - path, - comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, - encoding: str = "utf-8", -): ... +def read_adjlist(path, comments: str = "#", delimiter=None, create_using=None, nodetype=None, encoding: str = "utf-8"): ... diff --git a/stubs/networkx/networkx/readwrite/edgelist.pyi b/stubs/networkx/networkx/readwrite/edgelist.pyi index ddb2b6d88..fb7d6d743 100644 --- a/stubs/networkx/networkx/readwrite/edgelist.pyi +++ b/stubs/networkx/networkx/readwrite/edgelist.pyi @@ -15,32 +15,20 @@ __all__ = [ def generate_edgelist(G, delimiter: str = " ", data: bool = True) -> Generator[Incomplete, None, None]: ... def write_edgelist(G, path, comments: str = "#", delimiter: str = " ", data: bool = True, encoding: str = "utf-8") -> None: ... @_dispatchable -def parse_edgelist( - lines, - comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, - data: bool = True, -): ... +def parse_edgelist(lines, comments: str = "#", delimiter=None, create_using=None, nodetype=None, data: bool = True): ... @_dispatchable def read_edgelist( path, comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, + delimiter=None, + create_using=None, + nodetype=None, data: bool = True, - edgetype: Incomplete | None = None, + edgetype=None, encoding: str = "utf-8", ): ... def write_weighted_edgelist(G, path, comments: str = "#", delimiter: str = " ", encoding: str = "utf-8") -> None: ... @_dispatchable def read_weighted_edgelist( - path, - comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, - encoding: str = "utf-8", + path, comments: str = "#", delimiter=None, create_using=None, nodetype=None, encoding: str = "utf-8" ): ... diff --git a/stubs/networkx/networkx/readwrite/gexf.pyi b/stubs/networkx/networkx/readwrite/gexf.pyi index 8de89fcd3..f7b39bd1c 100644 --- a/stubs/networkx/networkx/readwrite/gexf.pyi +++ b/stubs/networkx/networkx/readwrite/gexf.pyi @@ -10,7 +10,7 @@ def generate_gexf( G, encoding: str = "utf-8", prettyprint: bool = True, version: str = "1.2draft" ) -> Generator[Incomplete, Incomplete, None]: ... @_dispatchable -def read_gexf(path, node_type: Incomplete | None = None, relabel: bool = False, version: str = "1.2draft"): ... +def read_gexf(path, node_type=None, relabel: bool = False, version: str = "1.2draft"): ... class GEXF: versions: Incomplete @@ -34,9 +34,7 @@ class GEXFWriter(GEXF): attr_id: Incomplete all_edge_ids: Incomplete attr: Incomplete - def __init__( - self, graph: Incomplete | None = None, encoding: str = "utf-8", prettyprint: bool = True, version: str = "1.2draft" - ) -> None: ... + def __init__(self, graph=None, encoding: str = "utf-8", prettyprint: bool = True, version: str = "1.2draft") -> None: ... graph_element: Incomplete def add_graph(self, G) -> None: ... def add_nodes(self, G, graph_element) -> None: ... @@ -54,12 +52,12 @@ class GEXFWriter(GEXF): class GEXFReader(GEXF): node_type: Incomplete simple_graph: bool - def __init__(self, node_type: Incomplete | None = None, version: str = "1.2draft") -> None: ... + def __init__(self, node_type=None, version: str = "1.2draft") -> None: ... xml: Incomplete def __call__(self, stream): ... timeformat: Incomplete def make_graph(self, graph_xml): ... - def add_node(self, G, node_xml, node_attr, node_pid: Incomplete | None = None) -> None: ... + def add_node(self, G, node_xml, node_attr, node_pid=None) -> None: ... def add_start_end(self, data, xml): ... def add_viz(self, data, node_xml): ... def add_parents(self, data, node_xml): ... diff --git a/stubs/networkx/networkx/readwrite/gml.pyi b/stubs/networkx/networkx/readwrite/gml.pyi index 63fae3c7b..53be3c51c 100644 --- a/stubs/networkx/networkx/readwrite/gml.pyi +++ b/stubs/networkx/networkx/readwrite/gml.pyi @@ -10,9 +10,9 @@ _T = TypeVar("_T") __all__ = ["read_gml", "parse_gml", "generate_gml", "write_gml"] @_dispatchable -def read_gml(path, label: str = "label", destringizer: Incomplete | None = None): ... +def read_gml(path, label: str = "label", destringizer=None): ... @_dispatchable -def parse_gml(lines, label: str = "label", destringizer: Incomplete | None = None): ... +def parse_gml(lines, label: str = "label", destringizer=None): ... class Pattern(Enum): KEYS = 0 @@ -29,5 +29,5 @@ class Token(NamedTuple, Generic[_T]): line: int position: int -def generate_gml(G, stringizer: Incomplete | None = None) -> Generator[Incomplete, Incomplete, None]: ... -def write_gml(G, path, stringizer: Incomplete | None = None) -> None: ... +def generate_gml(G, stringizer=None) -> Generator[Incomplete, Incomplete, None]: ... +def write_gml(G, path, stringizer=None) -> None: ... diff --git a/stubs/networkx/networkx/readwrite/graph6.pyi b/stubs/networkx/networkx/readwrite/graph6.pyi index 092bffdf2..748be2976 100644 --- a/stubs/networkx/networkx/readwrite/graph6.pyi +++ b/stubs/networkx/networkx/readwrite/graph6.pyi @@ -1,12 +1,10 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["from_graph6_bytes", "read_graph6", "to_graph6_bytes", "write_graph6"] @_dispatchable def from_graph6_bytes(bytes_in): ... -def to_graph6_bytes(G, nodes: Incomplete | None = None, header: bool = True): ... +def to_graph6_bytes(G, nodes=None, header: bool = True): ... @_dispatchable def read_graph6(path): ... -def write_graph6(G, path, nodes: Incomplete | None = None, header: bool = True): ... +def write_graph6(G, path, nodes=None, header: bool = True): ... diff --git a/stubs/networkx/networkx/readwrite/graphml.pyi b/stubs/networkx/networkx/readwrite/graphml.pyi index 2ef976b51..60cc90a5c 100644 --- a/stubs/networkx/networkx/readwrite/graphml.pyi +++ b/stubs/networkx/networkx/readwrite/graphml.pyi @@ -22,7 +22,7 @@ def write_graphml_xml( prettyprint: bool = True, infer_numeric_types: bool = False, named_key_ids: bool = False, - edge_id_from_attribute: Incomplete | None = None, + edge_id_from_attribute=None, ) -> None: ... def write_graphml_lxml( G, @@ -31,14 +31,10 @@ def write_graphml_lxml( prettyprint: bool = True, infer_numeric_types: bool = False, named_key_ids: bool = False, - edge_id_from_attribute: Incomplete | None = None, + edge_id_from_attribute=None, ): ... def generate_graphml( - G, - encoding: str = "utf-8", - prettyprint: bool = True, - named_key_ids: bool = False, - edge_id_from_attribute: Incomplete | None = None, + G, encoding: str = "utf-8", prettyprint: bool = True, named_key_ids: bool = False, edge_id_from_attribute=None ) -> Generator[Incomplete, Incomplete, None]: ... @_dispatchable def read_graphml(path, node_type=..., edge_key_type=..., force_multigraph: bool = False): ... @@ -69,16 +65,16 @@ class GraphMLWriter(GraphML): attribute_types: Incomplete def __init__( self, - graph: Incomplete | None = None, + graph=None, encoding: str = "utf-8", prettyprint: bool = True, infer_numeric_types: bool = False, named_key_ids: bool = False, - edge_id_from_attribute: Incomplete | None = None, + edge_id_from_attribute=None, ) -> None: ... def attr_type(self, name, scope, value): ... def get_key(self, name, attr_type, scope, default): ... - def add_data(self, name, element_type, value, scope: str = "all", default: Incomplete | None = None): ... + def add_data(self, name, element_type, value, scope: str = "all", default=None): ... def add_attributes(self, scope, xml_obj, data, default) -> None: ... def add_nodes(self, G, graph_element) -> None: ... def add_edges(self, G, graph_element) -> None: ... @@ -104,16 +100,16 @@ class GraphMLWriterLxml(GraphMLWriter): def __init__( self, path, - graph: Incomplete | None = None, + graph=None, encoding: str = "utf-8", prettyprint: bool = True, infer_numeric_types: bool = False, named_key_ids: bool = False, - edge_id_from_attribute: Incomplete | None = None, + edge_id_from_attribute=None, ) -> None: ... def add_graph_element(self, G) -> None: ... def add_attributes(self, scope, xml_obj, data, default) -> None: ... - def dump(self, stream: Incomplete | None = None) -> None: ... + def dump(self, stream=None) -> None: ... write_graphml = write_graphml_lxml @@ -124,8 +120,8 @@ class GraphMLReader(GraphML): edge_ids: Incomplete def __init__(self, node_type=..., edge_key_type=..., force_multigraph: bool = False) -> None: ... xml: Incomplete - def __call__(self, path: Incomplete | None = None, string: Incomplete | None = None) -> Generator[Incomplete, None, None]: ... - def make_graph(self, graph_xml, graphml_keys, defaults, G: Incomplete | None = None): ... + def __call__(self, path=None, string=None) -> Generator[Incomplete, None, None]: ... + def make_graph(self, graph_xml, graphml_keys, defaults, G=None): ... def add_node(self, G, node_xml, graphml_keys, defaults) -> None: ... def add_edge(self, G, edge_element, graphml_keys) -> None: ... def decode_data_elements(self, graphml_keys, obj_xml): ... diff --git a/stubs/networkx/networkx/readwrite/json_graph/node_link.pyi b/stubs/networkx/networkx/readwrite/json_graph/node_link.pyi index 2f15c525d..9bec26bad 100644 --- a/stubs/networkx/networkx/readwrite/json_graph/node_link.pyi +++ b/stubs/networkx/networkx/readwrite/json_graph/node_link.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["node_link_data", "node_link_graph"] @@ -20,7 +18,7 @@ def node_link_graph( data, directed: bool = False, multigraph: bool = True, - attrs: Incomplete | None = None, + attrs=None, *, source: str = "source", target: str = "target", diff --git a/stubs/networkx/networkx/readwrite/multiline_adjlist.pyi b/stubs/networkx/networkx/readwrite/multiline_adjlist.pyi index a83096ae3..a75f916bb 100644 --- a/stubs/networkx/networkx/readwrite/multiline_adjlist.pyi +++ b/stubs/networkx/networkx/readwrite/multiline_adjlist.pyi @@ -8,21 +8,8 @@ __all__ = ["generate_multiline_adjlist", "write_multiline_adjlist", "parse_multi def generate_multiline_adjlist(G, delimiter: str = " ") -> Generator[Incomplete, None, None]: ... def write_multiline_adjlist(G, path, delimiter: str = " ", comments: str = "#", encoding: str = "utf-8") -> None: ... @_dispatchable -def parse_multiline_adjlist( - lines, - comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, - edgetype: Incomplete | None = None, -): ... +def parse_multiline_adjlist(lines, comments: str = "#", delimiter=None, create_using=None, nodetype=None, edgetype=None): ... @_dispatchable def read_multiline_adjlist( - path, - comments: str = "#", - delimiter: Incomplete | None = None, - create_using: Incomplete | None = None, - nodetype: Incomplete | None = None, - edgetype: Incomplete | None = None, - encoding: str = "utf-8", + path, comments: str = "#", delimiter=None, create_using=None, nodetype=None, edgetype=None, encoding: str = "utf-8" ): ... diff --git a/stubs/networkx/networkx/readwrite/sparse6.pyi b/stubs/networkx/networkx/readwrite/sparse6.pyi index 10a140c0a..b1e6e56a5 100644 --- a/stubs/networkx/networkx/readwrite/sparse6.pyi +++ b/stubs/networkx/networkx/readwrite/sparse6.pyi @@ -1,12 +1,10 @@ -from _typeshed import Incomplete - from networkx.utils.backends import _dispatchable __all__ = ["from_sparse6_bytes", "read_sparse6", "to_sparse6_bytes", "write_sparse6"] @_dispatchable def from_sparse6_bytes(string): ... -def to_sparse6_bytes(G, nodes: Incomplete | None = None, header: bool = True): ... +def to_sparse6_bytes(G, nodes=None, header: bool = True): ... @_dispatchable def read_sparse6(path): ... -def write_sparse6(G, path, nodes: Incomplete | None = None, header: bool = True) -> None: ... +def write_sparse6(G, path, nodes=None, header: bool = True) -> None: ... diff --git a/stubs/networkx/networkx/readwrite/text.pyi b/stubs/networkx/networkx/readwrite/text.pyi index 8a2bf32fb..3a1fe2e87 100644 --- a/stubs/networkx/networkx/readwrite/text.pyi +++ b/stubs/networkx/networkx/readwrite/text.pyi @@ -49,19 +49,14 @@ class UtfUndirectedGlyphs(UtfBaseGlyphs): vertical_edge: ClassVar[str] def generate_network_text( - graph, - with_labels: bool = True, - sources: Incomplete | None = None, - max_depth: Incomplete | None = None, - ascii_only: bool = False, - vertical_chains: bool = False, + graph, with_labels: bool = True, sources=None, max_depth=None, ascii_only: bool = False, vertical_chains: bool = False ) -> Generator[Incomplete, None, Incomplete]: ... def write_network_text( graph, - path: Incomplete | None = None, + path=None, with_labels: bool = True, - sources: Incomplete | None = None, - max_depth: Incomplete | None = None, + sources=None, + max_depth=None, ascii_only: bool = False, end: str = "\n", vertical_chains=False, diff --git a/stubs/networkx/networkx/relabel.pyi b/stubs/networkx/networkx/relabel.pyi index 4951676ca..71e03625f 100644 --- a/stubs/networkx/networkx/relabel.pyi +++ b/stubs/networkx/networkx/relabel.pyi @@ -1,4 +1,3 @@ -from _typeshed import Incomplete from collections.abc import Hashable, Mapping from typing import Literal, TypeVar, overload @@ -26,5 +25,5 @@ def convert_node_labels_to_integers( G: Graph[Hashable], first_label: int = 0, ordering: Literal["default", "sorted", "increasing degree", "decreasing degree"] = "default", - label_attribute: Incomplete | None = None, + label_attribute=None, ) -> Graph[int]: ... diff --git a/stubs/networkx/networkx/utils/configs.pyi b/stubs/networkx/networkx/utils/configs.pyi index 1d165b9fb..780ccf723 100644 --- a/stubs/networkx/networkx/utils/configs.pyi +++ b/stubs/networkx/networkx/utils/configs.pyi @@ -24,7 +24,7 @@ if sys.version_info >= (3, 10): def __getitem__(self, key: str): ... def __setitem__(self, key: str, value) -> None: ... def __delitem__(self, key: str) -> None: ... - def get(self, key: str, default: Incomplete | None = None): ... + def get(self, key: str, default=None): ... def items(self) -> ItemsView[str, Incomplete]: ... def keys(self) -> KeysView[str]: ... def values(self) -> ValuesView[Incomplete]: ... @@ -50,7 +50,7 @@ else: def __getitem__(self, key: str): ... def __setitem__(self, key: str, value) -> None: ... def __delitem__(self, key: str) -> None: ... - def get(self, key: str, default: Incomplete | None = None): ... + def get(self, key: str, default=None): ... def items(self) -> ItemsView[str, Incomplete]: ... def keys(self) -> KeysView[str]: ... def values(self) -> ValuesView[Incomplete]: ... diff --git a/stubs/networkx/networkx/utils/heaps.pyi b/stubs/networkx/networkx/utils/heaps.pyi index 43cd69b1b..95862f2da 100644 --- a/stubs/networkx/networkx/utils/heaps.pyi +++ b/stubs/networkx/networkx/utils/heaps.pyi @@ -11,7 +11,7 @@ class MinHeap: def __init__(self) -> None: ... def min(self) -> None: ... def pop(self) -> None: ... - def get(self, key, default: Incomplete | None = None) -> None: ... + def get(self, key, default=None) -> None: ... def insert(self, key, value, allow_increase: bool = False) -> None: ... def __nonzero__(self): ... def __bool__(self) -> bool: ... @@ -29,12 +29,12 @@ class PairingHeap(MinHeap): def __init__(self) -> None: ... def min(self): ... def pop(self): ... - def get(self, key, default: Incomplete | None = None): ... + def get(self, key, default=None): ... def insert(self, key, value, allow_increase: bool = False): ... class BinaryHeap(MinHeap): def __init__(self) -> None: ... def min(self): ... def pop(self): ... - def get(self, key, default: Incomplete | None = None): ... + def get(self, key, default=None): ... def insert(self, key, value, allow_increase: bool = False): ... diff --git a/stubs/networkx/networkx/utils/mapped_queue.pyi b/stubs/networkx/networkx/utils/mapped_queue.pyi index e5eb305ab..86e8c0e0e 100644 --- a/stubs/networkx/networkx/utils/mapped_queue.pyi +++ b/stubs/networkx/networkx/utils/mapped_queue.pyi @@ -17,9 +17,9 @@ class _HeapElement: class MappedQueue: heap: Incomplete position: Incomplete - def __init__(self, data: Incomplete | None = None) -> None: ... + def __init__(self, data=None) -> None: ... def __len__(self) -> int: ... - def push(self, elt, priority: Incomplete | None = None): ... + def push(self, elt, priority=None): ... def pop(self): ... - def update(self, elt, new, priority: Incomplete | None = None) -> None: ... + def update(self, elt, new, priority=None) -> None: ... def remove(self, elt) -> None: ... diff --git a/stubs/networkx/networkx/utils/misc.pyi b/stubs/networkx/networkx/utils/misc.pyi index 261e030b1..62fb3c6b3 100644 --- a/stubs/networkx/networkx/utils/misc.pyi +++ b/stubs/networkx/networkx/utils/misc.pyi @@ -1,5 +1,4 @@ import random -from _typeshed import Incomplete from types import ModuleType from typing_extensions import TypeAlias @@ -27,23 +26,23 @@ _RandomNumberGenerator: TypeAlias = ( ) _RandomState: TypeAlias = int | _RandomNumberGenerator | None -def flatten(obj, result: Incomplete | None = None): ... +def flatten(obj, result=None): ... def make_list_of_ints(sequence): ... -def dict_to_numpy_array(d, mapping: Incomplete | None = None): ... +def dict_to_numpy_array(d, mapping=None): ... def arbitrary_element(iterable): ... def pairwise(iterable, cyclic: bool = False): ... def groups(many_to_one): ... -def create_random_state(random_state: Incomplete | None = None): ... +def create_random_state(random_state=None): ... class PythonRandomViaNumpyBits(random.Random): def __init__(self, rng: numpy.random.Generator | None = None) -> None: ... def getrandbits(self, k: int) -> int: ... class PythonRandomInterface: - def __init__(self, rng: Incomplete | None = None) -> None: ... + def __init__(self, rng=None) -> None: ... def random(self): ... def uniform(self, a, b): ... - def randrange(self, a, b: Incomplete | None = None): ... + def randrange(self, a, b=None): ... def choice(self, seq): ... def gauss(self, mu, sigma): ... def shuffle(self, seq): ... diff --git a/stubs/networkx/networkx/utils/random_sequence.pyi b/stubs/networkx/networkx/utils/random_sequence.pyi index 3d89df428..101004bba 100644 --- a/stubs/networkx/networkx/utils/random_sequence.pyi +++ b/stubs/networkx/networkx/utils/random_sequence.pyi @@ -1,5 +1,3 @@ -from _typeshed import Incomplete - __all__ = [ "powerlaw_sequence", "zipf_rv", @@ -9,11 +7,9 @@ __all__ = [ "weighted_choice", ] -def powerlaw_sequence(n, exponent: float = 2.0, seed: Incomplete | None = None): ... -def zipf_rv(alpha, xmin: int = 1, seed: Incomplete | None = None): ... +def powerlaw_sequence(n, exponent: float = 2.0, seed=None): ... +def zipf_rv(alpha, xmin: int = 1, seed=None): ... def cumulative_distribution(distribution): ... -def discrete_sequence( - n, distribution: Incomplete | None = None, cdistribution: Incomplete | None = None, seed: Incomplete | None = None -): ... -def random_weighted_sample(mapping, k, seed: Incomplete | None = None): ... -def weighted_choice(mapping, seed: Incomplete | None = None): ... +def discrete_sequence(n, distribution=None, cdistribution=None, seed=None): ... +def random_weighted_sample(mapping, k, seed=None): ... +def weighted_choice(mapping, seed=None): ... diff --git a/stubs/networkx/networkx/utils/rcm.pyi b/stubs/networkx/networkx/utils/rcm.pyi index cfe7c2deb..cf8ffb8ab 100644 --- a/stubs/networkx/networkx/utils/rcm.pyi +++ b/stubs/networkx/networkx/utils/rcm.pyi @@ -3,5 +3,5 @@ from collections.abc import Generator __all__ = ["cuthill_mckee_ordering", "reverse_cuthill_mckee_ordering"] -def cuthill_mckee_ordering(G, heuristic: Incomplete | None = None) -> Generator[Incomplete, Incomplete, None]: ... -def reverse_cuthill_mckee_ordering(G, heuristic: Incomplete | None = None): ... +def cuthill_mckee_ordering(G, heuristic=None) -> Generator[Incomplete, Incomplete, None]: ... +def reverse_cuthill_mckee_ordering(G, heuristic=None): ... diff --git a/stubs/networkx/networkx/utils/union_find.pyi b/stubs/networkx/networkx/utils/union_find.pyi index fe50ede3c..97df662a3 100644 --- a/stubs/networkx/networkx/utils/union_find.pyi +++ b/stubs/networkx/networkx/utils/union_find.pyi @@ -4,7 +4,7 @@ from collections.abc import Generator, Iterator class UnionFind: parents: Incomplete weights: Incomplete - def __init__(self, elements: Incomplete | None = None) -> None: ... + def __init__(self, elements=None) -> None: ... def __getitem__(self, object): ... def __iter__(self) -> Iterator[Incomplete]: ... def to_sets(self) -> Generator[Incomplete, Incomplete, None]: ...