We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1b953fe commit 13351f9Copy full SHA for 13351f9
src/radius_clustering/utils/mds.pyx
@@ -39,7 +39,7 @@ cdef extern from "mds_core.cpp":
39
40
cdef Result iterated_greedy_wrapper(int numNodes, const vector[int]& edges_list, int nb_edges, string name) nogil
41
42
-def solve_mds(int num_nodes, np.ndarray[np.uint32_t, ndim=1, mode="c"] edges not None, int nb_edges, str name):
+def solve_mds(int num_nodes, np.ndarray[int, ndim=1, mode="c"] edges not None, int nb_edges, str name):
43
"""
44
Solve the Minimum Dominating Set problem for a given graph.
45
0 commit comments