[networkx] Use concrete node types for the Harary, circulant and expander generators (#16635)

Author: dannyshafer

stubs/networkx/networkx/generators/classic.pyi

@@ -51,7 +51,7 @@ def circular_ladder_graph(n, create_using=None): ...
 @_dispatchable
 def circulant_graph(
     n: int, offsets: list[int], create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None
-) -> Graph[Incomplete]: ...
+) -> Graph[int]: ...
 @_dispatchable
 def cycle_graph(n: int | Iterable[Incomplete], create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None): ...
 @_dispatchable

stubs/networkx/networkx/generators/expanders.pyi

@@ -18,13 +18,13 @@ __all__ = [
 @_dispatchable
 def margulis_gabber_galil_graph(
     n: int, create_using: MultiGraph[Incomplete] | type[MultiGraph[Incomplete]] | None = None
-) -> Graph[Incomplete]: ...
+) -> Graph[tuple[int, int]]: ...
 @_dispatchable
-def chordal_cycle_graph(p: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None) -> Graph[Incomplete]: ...
+def chordal_cycle_graph(p: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None) -> Graph[int]: ...
 @_dispatchable
-def paley_graph(p: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None) -> Graph[Incomplete]: ...
+def paley_graph(p: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None) -> Graph[int]: ...
 @_dispatchable
-def maybe_regular_expander_graph(n: int, d: int, *, create_using=None, max_tries: int = 100, seed=None) -> Graph[Incomplete]: ...
+def maybe_regular_expander_graph(n: int, d: int, *, create_using=None, max_tries: int = 100, seed=None) -> Graph[int]: ...
 @deprecated(
     "`maybe_regular_expander` is a deprecated alias for `maybe_regular_expander_graph`. "
     "Use `maybe_regular_expander_graph` instead."
@@ -33,4 +33,4 @@ def maybe_regular_expander(n, d, *, create_using=None, max_tries: int = 100, see
 @_dispatchable
 def is_regular_expander(G: Graph[_Node], *, epsilon: float = 0) -> bool: ...
 @_dispatchable
-def random_regular_expander_graph(n: int, d: int, *, epsilon=0, create_using=None, max_tries=100, seed=None): ...
+def random_regular_expander_graph(n: int, d: int, *, epsilon=0, create_using=None, max_tries=100, seed=None) -> Graph[int]: ...

stubs/networkx/networkx/generators/harary_graph.pyi

@@ -6,10 +6,6 @@ from networkx.utils.backends import _dispatchable
 __all__ = ["hnm_harary_graph", "hkn_harary_graph"]
 
 @_dispatchable
-def hnm_harary_graph(
-    n: int, m: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None
-) -> Graph[Incomplete]: ...
+def hnm_harary_graph(n: int, m: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None) -> Graph[int]: ...
 @_dispatchable
-def hkn_harary_graph(
-    k: int, n: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None
-) -> Graph[Incomplete]: ...
+def hkn_harary_graph(k: int, n: int, create_using: Graph[Incomplete] | type[Graph[Incomplete]] | None = None) -> Graph[int]: ...