Add make_hypercube()

NAMESPACE

@@ -504,6 +504,7 @@ export(hrg.predict)
 export(hrg_tree)
 export(hub.score)
 export(hub_score)
+export(hypercube)
 export(identical_graphs)
 export(igraph.console)
 export(igraph.drl.coarsen)
@@ -665,6 +666,7 @@ export(make_full_citation_graph)
 export(make_full_graph)
 export(make_full_multipartite)
 export(make_graph)
+export(make_hypercube)
 export(make_kautz_graph)
 export(make_lattice)
 export(make_line_graph)

R/make.R

@@ -2028,6 +2028,42 @@ lattice <- function(...) constructor_spec(make_lattice, ...)
 
 ## -----------------------------------------------------------------
 
+#' Create a hypercube graph
+#'
+#' `r lifecycle::badge("experimental")`
+#'
+#' The n-dimensional hypercube graph has \eqn{2^n} vertices and
+#' \eqn{2^{n-1} n} edges.
+#' Two vertices are connected if the binary representations of their vertex
+#' IDs (minus one, to make them zero-based) differ in precisely one bit.
+#'
+#' @param n The dimension of the hypercube graph.
+#'   Must be non-negative and not greater than 57.
+#' @param directed Logical scalar, whether the graph should be directed.
+#'   If `TRUE`, edges point from vertices with lower IDs toward vertices
+#'   with higher IDs.
+#' @return An igraph graph.
+#'
+#' @concept hypercube
+#' @family deterministic constructors
+#' @export
+#' @examples
+#' # 3-dimensional hypercube (cube)
+#' print_all(make_hypercube(3))
+#' # 4-dimensional hypercube (tesseract)
+#' print_all(make_hypercube(4))
+#' @cdocs igraph_hypercube
+make_hypercube <- function(n, directed = FALSE) {
+  hypercube_impl(n = n, directed = directed)
+}
+
+#' @rdname make_hypercube
+#' @param ... Passed to `make_hypercube()`.
+#' @export
+hypercube <- function(...) constructor_spec(make_hypercube, ...)
+
+## -----------------------------------------------------------------
+
 #' Create a ring graph
 #'
 #' A ring is a one-dimensional lattice and this function is a special case

tests/testthat/test-make.R

@@ -205,6 +205,59 @@ test_that("make_lattice prints a warning for fractional length)", {
   expect_identical_graphs(lattice_rounded, lattice_integer)
 })
 
+test_that("make_hypercube works", {
+  # 0-dimensional hypercube has 1 vertex and 0 edges
+  hc0 <- make_hypercube(0)
+  expect_vcount(hc0, 1)
+  expect_ecount(hc0, 0)
+
+  # 1-dimensional hypercube (line segment) has 2 vertices and 1 edge
+  hc1 <- make_hypercube(1)
+  expect_vcount(hc1, 2)
+  expect_ecount(hc1, 1)
+
+  # 2-dimensional hypercube (square) has 4 vertices and 4 edges
+  hc2 <- make_hypercube(2)
+  expect_vcount(hc2, 4)
+  expect_ecount(hc2, 4)
+
+  # 3-dimensional hypercube (cube) has 8 vertices and 12 edges
+  hc3 <- make_hypercube(3)
+  expect_vcount(hc3, 8)
+  expect_ecount(hc3, 12)
+
+  # Verify edges for 3D hypercube
+  # Vertices should be connected if their IDs (minus 1) differ in exactly one bit
+  # IDs: 1(000), 2(001), 3(010), 4(011), 5(100), 6(101), 7(110), 8(111)
+  expected_edges <- make_empty_graph(n = 8) +
+    edges(c(
+      1, 2,  # 000 - 001
+      1, 3,  # 000 - 010
+      1, 5,  # 000 - 100
+      2, 4,  # 001 - 011
+      2, 6,  # 001 - 101
+      3, 4,  # 010 - 011
+      3, 7,  # 010 - 110
+      4, 8,  # 011 - 111
+      5, 6,  # 100 - 101
+      5, 7,  # 100 - 110
+      6, 8,  # 101 - 111
+      7, 8   # 110 - 111
+    ))
+  expect_equal(as_edgelist(hc3), as_edgelist(expected_edges))
+
+  # Test directed hypercube
+  hc3_directed <- make_hypercube(3, directed = TRUE)
+  expect_true(is_directed(hc3_directed))
+  expect_ecount(hc3_directed, 12)
+})
+
+test_that("make_hypercube can be used with make_()", {
+  hc1 <- make_hypercube(3)
+  hc2 <- make_(hypercube(3))
+  expect_identical_graphs(hc1, hc2)
+})
+
 test_that("make_graph works", {
   graph_make <- make_graph(1:10)
   graph_elist <- make_empty_graph(n = 10) + edges(1:10)