feat: Add cliques and independent vertices functions

Author: heavywatal

NAMESPACE

@@ -36,6 +36,9 @@ export(average_path_length)
 export(betweenness)
 export(bridges)
 export(canonical_permutation)
+export(clique_number)
+export(clique_size_hist)
+export(cliques)
 export(closeness)
 export(connected_components)
 export(constraint)
@@ -97,21 +100,28 @@ export(igraph_rng_seed)
 export(igraph_to)
 export(igraph_version)
 export(incident)
+export(independence_number)
+export(independent_vertex_sets)
 export(induced_subgraph)
 export(induced_subgraph_edges)
 export(is_acyclic)
 export(is_biconnected)
+export(is_clique)
+export(is_complete)
 export(is_connected)
 export(is_dag)
 export(is_directed)
 export(is_eulerian)
 export(is_igraph)
+export(is_independent_vertex_set)
 export(is_same_graph)
 export(is_simple)
 export(is_sink)
 export(is_source)
 export(isomorphic)
 export(k_regular_game)
+export(largest_cliques)
+export(largest_independent_vertex_sets)
 export(layout_circle)
 export(layout_drl)
 export(layout_fruchterman_reingold)
@@ -124,6 +134,10 @@ export(layout_reingold_tilford_circular)
 export(layout_star)
 export(local_efficiency)
 export(maxdegree)
+export(maximal_cliques)
+export(maximal_cliques_count)
+export(maximal_cliques_hist)
+export(maximal_independent_vertex_sets)
 export(neighborhood)
 export(neighborhood_size)
 export(neighbors)

R/cliques.R

@@ -0,0 +1,104 @@
+#' Cliques
+#'
+#' A graph is considered complete if all pairs of different vertices are adjacent.
+#' Cliques are fully connected subgraphs of a graph.
+#' @source <https://igraph.org/c/doc/igraph-Cliques.html#cliques>
+#' @inheritParams common_params
+#' @returns `is_complete()` and `is_clique()` return a logical value.
+#' @name cliques
+#' @rdname cliques
+#' @export
+is_complete = function(graph) {
+  .Call(`_igraphlite_is_complete_`, graph)
+}
+
+#' @param candidate The vertex set to test for being a clique.
+#' @rdname cliques
+#' @export
+is_clique = function(graph, candidate = integer(0L), directed = is_directed(graph)) {
+  .Call(`_igraphlite_is_clique_`, graph, candidate, directed)
+}
+
+#' @param min_size,max_size An integer specifying the minimum/maximum size of the
+#' sets to be returned. If negative or zero, no lower bound will be used.
+#' @param max_results At most this many sets will be recorded.
+#' If negative, no limit is applied.
+#' @rdname cliques
+#' @export
+cliques = function(graph, min_size = 0L, max_size = -1L, max_results = -1L) {
+  .Call(`_igraphlite_cliques_`, graph, min_size, max_size, max_results)
+}
+
+#' @rdname cliques
+#' @export
+clique_size_hist = function(graph, min_size = 0L, max_size = -1L) {
+  .Call(`_igraphlite_clique_size_hist_`, graph, min_size, max_size) |> as.integer()
+}
+
+#' @rdname cliques
+#' @export
+largest_cliques = function(graph) {
+  .Call(`_igraphlite_largest_cliques_`, graph)
+}
+
+#' @rdname cliques
+#' @export
+maximal_cliques = function(graph, min_size = 0L, max_size = -1L, max_results = -1L) {
+  .Call(`_igraphlite_maximal_cliques_`, graph, min_size, max_size, max_results)
+}
+
+#' @rdname cliques
+#' @export
+maximal_cliques_count = function(graph, min_size = 0L, max_size = -1L) {
+  .Call(`_igraphlite_maximal_cliques_count_`, graph, min_size, max_size)
+}
+
+#' @rdname cliques
+#' @export
+maximal_cliques_hist = function(graph, min_size = 0L, max_size = -1L) {
+  .Call(`_igraphlite_maximal_cliques_hist_`, graph, min_size, max_size) |> as.integer()
+}
+
+#' @rdname cliques
+#' @export
+clique_number = function(graph) {
+  .Call(`_igraphlite_clique_number_`, graph)
+}
+
+
+#' Independent vertex sets
+#'
+#' A vertex set is considered independent if there are no edges between them.
+#' @source <https://igraph.org/c/doc/igraph-Cliques.html#independent-vertex-sets>
+#' @inheritParams common_params
+#' @inheritParams cliques
+#' @name independent
+#' @rdname independent
+#' @export
+is_independent_vertex_set = function(graph, candidate = integer(0L)) {
+  .Call(`_igraphlite_is_independent_vertex_set_`, graph, candidate)
+}
+
+#' @rdname independent
+#' @export
+independent_vertex_sets = function(graph, min_size = 0L, max_size = -1L, max_results = -1L) {
+  .Call(`_igraphlite_independent_vertex_sets_`, graph, min_size, max_size, max_results)
+}
+
+#' @rdname independent
+#' @export
+largest_independent_vertex_sets = function(graph) {
+  .Call(`_igraphlite_largest_independent_vertex_sets_`, graph)
+}
+
+#' @rdname independent
+#' @export
+maximal_independent_vertex_sets = function(graph, min_size = 0L, max_size = -1L, max_results = -1L) {
+  .Call(`_igraphlite_maximal_independent_vertex_sets_`, graph, min_size, max_size, max_results)
+}
+
+#' @rdname independent
+#' @export
+independence_number = function(graph) {
+  .Call(`_igraphlite_independence_number_`, graph)
+}

R/cpp11.R

@@ -168,6 +168,62 @@ convergence_degree_ <- function(graph) {
   .Call(`_igraphlite_convergence_degree_`, graph)
 }
 
+is_complete_ <- function(graph) {
+  .Call(`_igraphlite_is_complete_`, graph)
+}
+
+is_clique_ <- function(graph, candidate, directed) {
+  .Call(`_igraphlite_is_clique_`, graph, candidate, directed)
+}
+
+cliques_ <- function(graph, min_size, max_size, max_results) {
+  .Call(`_igraphlite_cliques_`, graph, min_size, max_size, max_results)
+}
+
+clique_size_hist_ <- function(graph, min_size, max_size) {
+  .Call(`_igraphlite_clique_size_hist_`, graph, min_size, max_size)
+}
+
+largest_cliques_ <- function(graph) {
+  .Call(`_igraphlite_largest_cliques_`, graph)
+}
+
+maximal_cliques_ <- function(graph, min_size, max_size, max_results) {
+  .Call(`_igraphlite_maximal_cliques_`, graph, min_size, max_size, max_results)
+}
+
+maximal_cliques_count_ <- function(graph, min_size, max_size) {
+  .Call(`_igraphlite_maximal_cliques_count_`, graph, min_size, max_size)
+}
+
+maximal_cliques_hist_ <- function(graph, min_size, max_size) {
+  .Call(`_igraphlite_maximal_cliques_hist_`, graph, min_size, max_size)
+}
+
+clique_number_ <- function(graph) {
+  .Call(`_igraphlite_clique_number_`, graph)
+}
+
+is_independent_vertex_set_ <- function(graph, candidate) {
+  .Call(`_igraphlite_is_independent_vertex_set_`, graph, candidate)
+}
+
+independent_vertex_sets_ <- function(graph, min_size, max_size, max_results) {
+  .Call(`_igraphlite_independent_vertex_sets_`, graph, min_size, max_size, max_results)
+}
+
+largest_independent_vertex_sets_ <- function(graph) {
+  .Call(`_igraphlite_largest_independent_vertex_sets_`, graph)
+}
+
+maximal_independent_vertex_sets_ <- function(graph, min_size, max_size, max_results) {
+  .Call(`_igraphlite_maximal_independent_vertex_sets_`, graph, min_size, max_size, max_results)
+}
+
+independence_number_ <- function(graph) {
+  .Call(`_igraphlite_independence_number_`, graph)
+}
+
 connected_components_ <- function(graph, mode) {
   .Call(`_igraphlite_connected_components_`, graph, mode)
 }

_pkgdown.yml

@@ -64,6 +64,11 @@ reference:
 - contents:
   - is_acyclic
   - is_eulerian
+- title: Cliques and independent vertex sets
+  desc: https://igraph.org/c/doc/igraph-Cliques.html
+- contents:
+  - cliques
+  - independent
 - title: Graph isomorphism
   desc: https://igraph.org/c/doc/igraph-Isomorphism.html
 - contents: