{ "_id": "6a26890d794753ddbc3f2a89", "Package": "HyperG", "Type": "Package", "Title": "Hypergraphs in R", "Version": "1.0.0", "Date": "2021-03-01", "Author": "David J. Marchette", "Maintainer": "David J. Marchette ", "Description": "Implements various tools for storing and analyzing\nhypergraphs. Handles basic undirected, unweighted hypergraphs,\nand various ways of creating hypergraphs from a number of\nrepresentations, and converting between graphs and hypergraphs.", "License": "GPL (>= 2)", "Config/testthat/edition": "3", "NeedsCompilation": "no", "Packaged": { "Date": "2026-06-08 09:15:05 UTC", "User": "root" }, "Config/pak/sysreqs": "libglpk-dev libxml2-dev", "Repository": "https://dmarchette.r-universe.dev", "Date/Publication": "2021-03-04 08:20:11 UTC", "RemoteUrl": "https://github.com/cran/HyperG", "RemoteRef": "HEAD", "RemoteSha": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "MD5sum": "8e089cc82ff6521aa1e47171f05404e8", "_user": "dmarchette", "_type": "src", "_file": "HyperG_1.0.0.tar.gz", "_fileid": "e94119c2a63af60332c42708c6c47189f14c52cca6e88fbd16a8e3d3f1122e1d", "_filesize": 429584, "_sha256": "e94119c2a63af60332c42708c6c47189f14c52cca6e88fbd16a8e3d3f1122e1d", "_created": "2026-06-08T09:15:05.000Z", "_published": "2026-06-08T09:19:09.660Z", "_distro": "noble", "_jobs": [ { "job": 80060548518, "time": 141, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "7476071979" }, { "job": 80060548517, "time": 137, "config": "linux-release-x86_64", "r": "4.6.0", "check": "OK", "artifact": "7476070642" }, { "job": 80060548530, "time": 191, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "OK", "artifact": "7476078629" }, { "job": 80060548585, "time": 206, "config": "macos-release-arm64", "r": "4.6.0", "check": "OK", "artifact": "7476080368" }, { "job": 80059978051, "time": 185, "config": "source", "r": "4.6.0", "check": "OK", "artifact": "7476019447" }, { "job": 80060548528, "time": 111, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "7476061053" }, { "job": 80060548675, "time": 97, "config": "windows-devel", "r": "4.7.0", "check": "OK", "artifact": "7476057355" }, { "job": 80060548663, "time": 108, "config": "windows-oldrel", "r": "4.5.3", "check": "OK", "artifact": "7476059851" }, { "job": 80060548597, "time": 114, "config": "windows-release", "r": "4.6.0", "check": "OK", "artifact": "7476062044" } ], "_buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216", "_status": "success", "_host": "GitHub-Actions", "_upstream": "https://github.com/cran/HyperG", "_commit": { "id": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "author": "David J. Marchette ", "committer": "cran-robot ", "message": "version 1.0.0\n", "time": 1614846011 }, "_maintainer": { "name": "David J. Marchette", "email": "dmarchette@gmail.com", "login": "dmarchette", "description": "", "uuid": 1854355 }, "_registered": true, "_dependencies": [ { "package": "R", "version": ">= 3.1.0", "role": "Depends" }, { "package": "igraph", "role": "Depends" }, { "package": "mclust", "role": "Depends" }, { "package": "proxy", "role": "Imports" }, { "package": "RSpectra", "role": "Imports" }, { "package": "gtools", "role": "Imports" }, { "package": "grDevices", "role": "Imports" }, { "package": "Matrix", "role": "Imports" }, { "package": "stats", "role": "Imports" }, { "package": "graphics", "role": "Imports" }, { "package": "testthat", "version": ">= 3.0.0", "role": "Suggests" } ], "_owner": "cran", "_selfowned": true, "_usedby": 0, "_updates": [], "_tags": [], "_stars": 0, "_contributors": [ { "user": "dmarchette", "count": 1, "uuid": 1854355 } ], "_userbio": { "uuid": 1854355, "type": "user", "name": "David Marchette" }, "_downloads": { "count": 190, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/HyperG" }, "_searchresults": 15, "_rbuild": "4.6.0", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/HyperG.html", "manual.pdf" ], "_realowner": "dmarchette", "_cranurl": false, "_releases": [ { "version": "1.0.0", "date": "2021-03-04" } ], "_exports": [ "add.hyperedges", "as.binary.hypergraph", "as.bipartite", "as.graph", "as.hypergraph", "ase", "clique_hypergraph", "cluster_spectral", "delete.hyperedges", "dual_hypergraph", "edge_orders", "epsilon_hypergraph", "equivalent.hypergraphs", "graph2hypergraph", "H2", "hadjacency", "has.empty.hyperedges", "has.helly", "has.isolates", "has.loops", "hcorank", "hdegree", "hnames", "horder", "hrank", "hsize", "hyper_edges", "hypergraph_as_adjacency_matrix", "hypergraph_as_edgelist", "hypergraph_as_incidence_matrix", "hypergraph_from_edgelist", "hypergraph_from_fuzzy_clustering", "hypergraph_from_incidence_matrix", "hypergraph_from_literal", "hypergraph_from_membership", "hypergraph_from_spectral_clustering", "hypergraph_laplacian_matrix", "hypergraph.add.edges", "hypergraph.add.vertices", "hypergraph.complement", "hypergraph.delete.edges", "hypergraph.delete.vertices", "hypergraph.disjoint.union", "hypergraph.entropy", "hypergraph.intersection", "hypergraph.is.connected", "hypergraph.spectrum", "hypergraph.union", "hypergraph2graph", "incidence_matrix", "induced_hypergraph", "intersection_set", "is.bi.conformal", "is.conformal", "is.empty.hypergraph", "is.forest", "is.helly", "is.hypergraph", "is.hypertree", "is.linear", "is.simple", "is.star", "is.tree", "kCores", "knn_hypergraph", "line.graph", "lse", "make_empty_hypergraph", "pendant", "plot_geom_hypergraph", "plot.hypergraph", "plotDegreeDistribution", "print.hypergraph", "reduce.hypergraph", "remove.empty.hyperedges", "remove.isolates", "remove.loops", "remove.redundant.vertices", "reorder_vertices", "sample_geom_hypergraph", "sample_gnp_hypergraph", "sample_k_regular_hypergraph", "sample_k_uniform_hypergraph", "sample_sbm_hypergraph", "simplify.hypergraph", "subtree.hypergraph", "summary.hypergraph" ], "_help": [ { "page": "aaHyperG-package", "title": "Hypergraphs in R", "topics": [ "HyperG-package", "HyperG" ] }, { "page": "as.bipartite", "title": "Hypergraph as a bipartite graph.", "concept": [ "bipartite graph", "hypergraph representations as graphs" ], "topics": [ "as.bipartite" ] }, { "page": "as.hypergraph", "title": "Convert between hypergraphs and graphs.", "concept": [ "functons to convert between graphs and hypergraphs" ], "topics": [ "as.graph", "as.hypergraph", "graph2hypergraph", "hypergraph2graph" ] }, { "page": "ase", "title": "Adjacency spectral embedding.", "concept": [ "functions to embed a graph into Euclidean space", "functions to embed a hypergraph into Euclidean space" ], "topics": [ "ase", "hypergraph.spectrum", "lse" ] }, { "page": "clique_hypergraph", "title": "Clique Hypergraph", "concept": [ "constructing hypergraphs from graphs" ], "topics": [ "clique_hypergraph" ] }, { "page": "cluster_spectral", "title": "Spectral Graph Clustering", "concept": [ "cluster the vertices of a graph", "model-based clustering" ], "topics": [ "cluster_spectral" ] }, { "page": "dual", "title": "Dual hypergraph.", "topics": [ "dual_hypergraph" ] }, { "page": "epsilon_hypergraph", "title": "Epsilon-Ball Hypergraph", "topics": [ "epsilon_hypergraph" ] }, { "page": "equivalent.hypergraphs", "title": "Equivalent Hypergraphs", "topics": [ "as.binary.hypergraph", "equivalent.hypergraphs" ] }, { "page": "generalized2section", "title": "Two sections of a hypergraph.", "concept": [ "two-sections" ], "topics": [ "H2" ] }, { "page": "has.helly", "title": "Helly Property", "concept": [ "Helly property" ], "topics": [ "has.helly", "is.helly" ] }, { "page": "has.isolates", "title": "Test for loops, isolates and empty hyper-edges.", "topics": [ "has.empty.hyperedges", "has.isolates", "has.loops" ] }, { "page": "degree", "title": "Degrees of a hypergraph.", "topics": [ "hdegree", "plotDegreeDistribution" ] }, { "page": "horder", "title": "The number of vertices, edges and statistics of the hypergraph.", "topics": [ "edge_orders", "hnames", "horder", "hsize" ] }, { "page": "hrank", "title": "Rank of a hypergraph.", "topics": [ "hcorank", "hrank" ] }, { "page": "hypergraph_as_adjacency_matrix", "title": "Adjacency Matrix of a Hypergraph.", "topics": [ "hadjacency", "hypergraph_as_adjacency_matrix" ] }, { "page": "hypergraph_from_incidence_matrix", "title": "Hypergraph construction.", "concept": [ "constructing hypergraphs from matrices" ], "topics": [ "hypergraph_from_edgelist", "hypergraph_from_fuzzy_clustering", "hypergraph_from_incidence_matrix", "hypergraph_from_membership", "hypergraph_from_spectral_clustering" ] }, { "page": "hypergraph_from_literal", "title": "Hypergraph from literal.", "concept": [ "constructing hypergraphs" ], "topics": [ "hypergraph_from_literal" ] }, { "page": "hypergraph_laplacian_matrix", "title": "Laplacian Matrix", "topics": [ "hypergraph_laplacian_matrix" ] }, { "page": "add.edges", "title": "Add edges or vertices to a hypergraph.", "concept": [ "functions for manipulating hypergraph structure" ], "topics": [ "add.hyperedges", "hypergraph.add.edges", "hypergraph.add.vertices" ] }, { "page": "as.edgelist", "title": "Convert between hypergraphs and graphs.", "concept": [ "functions for manipulating hypergraph structure" ], "topics": [ "hypergraph_as_edgelist", "hyper_edges" ] }, { "page": "hypergraph.complement", "title": "The complement of a hypergraph.", "topics": [ "hypergraph.complement" ] }, { "page": "delete.edges", "title": "Delete edges or vertices of a hypergraph.", "topics": [ "delete.hyperedges", "hypergraph.delete.edges", "hypergraph.delete.vertices" ] }, { "page": "hypergraph.entropy", "title": "Hypergraph Entropy", "topics": [ "hypergraph.entropy" ] }, { "page": "is.connected", "title": "Is the hypergraph connected?", "topics": [ "hypergraph.is.connected" ] }, { "page": "hypergraph.union", "title": "Unions and intersections of hypergraphs.", "topics": [ "hypergraph.disjoint.union", "hypergraph.intersection", "hypergraph.union" ] }, { "page": "incidence_matrix", "title": "Graph Incidence Matrix.", "topics": [ "hypergraph_as_incidence_matrix", "incidence_matrix" ] }, { "page": "induced_hypergraph", "title": "Induced hypergraph.", "topics": [ "induced_hypergraph" ] }, { "page": "is.conformal", "title": "Conformal Hypergraphs", "concept": [ "Helly property" ], "topics": [ "is.bi.conformal", "is.conformal" ] }, { "page": "is.empty.hypergraph", "title": "Is the hypergraph empty.", "topics": [ "is.empty.hypergraph" ] }, { "page": "is.hypergraph", "title": "Is an object a hypergraph?", "topics": [ "is.hypergraph" ] }, { "page": "is.hypertree", "title": "Test for hypertree.", "topics": [ "is.hypertree" ] }, { "page": "is.linear", "title": "Is a hypergraph simple/linear?", "topics": [ "is.linear", "is.simple" ] }, { "page": "star", "title": "Is a hypergraph a star?", "topics": [ "intersection_set", "is.star" ] }, { "page": "is.tree", "title": "Test if a graph is a tree or a forest.", "topics": [ "is.forest", "is.tree" ] }, { "page": "kCores", "title": "K-Cores", "topics": [ "kCores" ] }, { "page": "knn_hypergraph", "title": "K-Nearest Neighbor Hypergraph.", "topics": [ "knn_hypergraph" ] }, { "page": "line.graph", "title": "Line Graph", "topics": [ "line.graph" ] }, { "page": "make_empty_hypergraph", "title": "Empty hypergraph.", "topics": [ "make_empty_hypergraph" ] }, { "page": "pendant", "title": "Pendant Vertices", "topics": [ "pendant" ] }, { "page": "plot.hypergraph", "title": "Plot a hypergraph.", "topics": [ "plot.hypergraph" ] }, { "page": "print.hypergraph", "title": "Print a hypergraph to the console.", "topics": [ "print.hypergraph" ] }, { "page": "reduce.hypergraph", "title": "Remove redundant hyperedges and isolated vertices.", "topics": [ "reduce.hypergraph", "remove.empty.hyperedges", "remove.isolates", "remove.loops", "simplify.hypergraph" ] }, { "page": "remove.redundant.vertices", "title": "Remove redundant vertices.", "topics": [ "remove.redundant.vertices" ] }, { "page": "reorder_vertices", "title": "Reorder the vertices of a hypergraph.", "topics": [ "reorder_vertices" ] }, { "page": "sample_geom_hypergraph", "title": "Construct a hypergraph from a random collection of points.", "topics": [ "plot_geom_hypergraph", "sample_geom_hypergraph" ] }, { "page": "sample_gnp_hypergraph", "title": "Erdos-Renyi hypergraphs.", "topics": [ "sample_gnp_hypergraph" ] }, { "page": "sample_k_uniform_hypergraph", "title": "Random k-uniform and k-regular hypergraphs.", "topics": [ "sample_k_regular_hypergraph", "sample_k_uniform_hypergraph" ] }, { "page": "sample_sbm_hypergraph", "title": "Sample from a stochastic block model.", "topics": [ "sample_sbm_hypergraph" ] }, { "page": "subtree.hypergraph", "title": "Subtree Hypergraph.", "topics": [ "subtree.hypergraph" ] }, { "page": "summary.hypergraph", "title": "Print a summary of the hypergraph to the console.", "topics": [ "summary.hypergraph" ] } ], "_rundeps": [ "cli", "cpp11", "glue", "gtools", "igraph", "lattice", "lifecycle", "magrittr", "Matrix", "mclust", "pkgconfig", "proxy", "Rcpp", "RcppEigen", "rlang", "RSpectra", "vctrs" ], "_score": 1.1760912590556813, "_indexed": true, "_nocasepkg": "hyperg", "_universes": [ "dmarchette" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "1.0.0", "date": "2026-06-08T09:17:13.000Z", "distro": "noble", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "fac562c42bae1e675ebc1281dc2ff71f8d63a6beb04ef50bc777af1e1e7f90e5", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.6.0", "os": "linux", "version": "1.0.0", "date": "2026-06-08T09:17:10.000Z", "distro": "noble", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "2621597a24d30c055d9e3c96cca34b8d8c3c7d90e8eafdddb080983dfd388f03", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.5.3", "os": "mac", "version": "1.0.0", "date": "2026-06-08T09:17:40.000Z", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "c0d3b156655cb5e84ced0b42a2e1519110527e889557f379b5c5f4bec8c6023e", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.6.0", "os": "mac", "version": "1.0.0", "date": "2026-06-08T09:17:30.000Z", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "476e7f03ddb79d9587bb95035aa86c57734da99b03d043694c57da3fa2ce9350", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.6.0", "os": "wasm", "version": "1.0.0", "date": "2026-06-08T09:17:16.000Z", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "1aea3b77019be1e1fa6f94e9deef5c15a48cd6e5982b02280665cd90eb3270a7", "status": "success", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.7.0", "os": "win", "version": "1.0.0", "date": "2026-06-08T09:16:26.000Z", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "d97899a195a37737affa97688620feabb76216d7e6fcabf0d5a20416aea0ee7a", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.5.3", "os": "win", "version": "1.0.0", "date": "2026-06-08T09:16:22.000Z", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "582a482e2b939fd018061f4f9369603af37278421a7210bcf04997343fc2a660", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" }, { "r": "4.6.0", "os": "win", "version": "1.0.0", "date": "2026-06-08T09:16:36.000Z", "commit": "48fea6d712fa369a6a85d486ce490a9fb0bac605", "fileid": "be43624427c0a304ae5263f8cf078a39d9085e0f29b04a6f691c693f0b7e8439", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/dmarchette/actions/runs/27127536216" } ] }