From 34472bbc98ad9969f3ce63fe930cd0ba6d0105d5 Mon Sep 17 00:00:00 2001
From: GiGaGon <107241144+MeGaGiGaGon@users.noreply.github.com>
Date: Thu, 28 Aug 2025 23:41:34 -0700
Subject: [PATCH] networkx: Add return types to
 algorithms/approximation/clique.pyi (#14660)

---
 .../networkx/algorithms/approximation/clique.pyi       | 10 ++++------
 1 file changed, 4 insertions(+), 6 deletions(-)

diff --git a/stubs/networkx/networkx/algorithms/approximation/clique.pyi b/stubs/networkx/networkx/algorithms/approximation/clique.pyi
index b906c7a95..f0d3d435d 100644
--- a/stubs/networkx/networkx/algorithms/approximation/clique.pyi
+++ b/stubs/networkx/networkx/algorithms/approximation/clique.pyi
@@ -1,15 +1,13 @@
-from _typeshed import Incomplete
-
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 __all__ = ["clique_removal", "max_clique", "large_clique_size", "maximum_independent_set"]
 
 @_dispatchable
-def maximum_independent_set(G: Graph[_Node]) -> set[Incomplete]: ...
+def maximum_independent_set(G: Graph[_Node]) -> set[_Node]: ...
 @_dispatchable
-def max_clique(G: Graph[_Node]) -> set[Incomplete]: ...
+def max_clique(G: Graph[_Node]) -> set[_Node]: ...
 @_dispatchable
-def clique_removal(G: Graph[_Node]): ...
+def clique_removal(G: Graph[_Node]) -> tuple[set[_Node], list[set[_Node]]]: ...
 @_dispatchable
-def large_clique_size(G: Graph[_Node]): ...
+def large_clique_size(G: Graph[_Node]) -> int: ...