@spec add_hyperedge(t(), hyperedge()) :: t()

Adds a hyperedge to the hypergraph. The hyperedge connects all vertices in the given list. Automatically adds any new vertices to the hypergraph.

@spec connected?(t(), vertex(), vertex()) :: boolean()

Checks if two vertices are connected by at least one hyperedge.

@spec degree(t(), vertex()) :: non_neg_integer()

Returns the degree of a vertex (number of hyperedges containing it).

@spec hyperedge_count(t()) :: non_neg_integer()

Returns the number of hyperedges in the hypergraph.

@spec hyperedge_size(hyperedge()) :: non_neg_integer()

Returns the size of a hyperedge (number of vertices it contains).

@spec hyperedges(t()) :: [hyperedge()]

Returns all hyperedges in the hypergraph.

@spec incident_hyperedges(t(), vertex()) :: [hyperedge()]

Returns hyperedges that contain the given vertex.

@spec neighbors(t(), vertex()) :: MapSet.t(vertex())

Returns all vertices that share at least one hyperedge with the given vertex.

@spec new() :: t()

Creates a new empty hypergraph.

@spec new([vertex()], [hyperedge()]) :: t()

Creates a new hypergraph with the given vertices and hyperedges.

@spec remove_hyperedge(t(), hyperedge()) :: t()

Removes a hyperedge from the hypergraph.

@spec remove_vertex(t(), vertex()) :: t()

Removes a vertex from the hypergraph and all hyperedges containing it.

@spec stats(t()) :: map()

Returns statistics about the hypergraph.

@spec to_graph(t()) :: [{vertex(), vertex()}]

Converts the hypergraph to a regular graph by creating pairwise edges for every pair of vertices that share a hyperedge.

Returns a list of 2-element tuples representing edges.

@spec vertex_count(t()) :: non_neg_integer()

Returns the number of vertices in the hypergraph.

@spec vertices(t()) :: MapSet.t(vertex())

Returns all vertices in the hypergraph.