hypergraph 1.0.2

Hypergraph is data structure library to create a directed hypergraph in which an hyperedge can join any number of vertices.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

![graph](hypergraph.svg)

---

![GitHub Workflow Status](https://img.shields.io/github/workflow/status/yamafaktory/hypergraph/ci?style=for-the-badge) ![Crates.io](https://img.shields.io/crates/v/hypergraph?style=for-the-badge) ![docs.rs](https://img.shields.io/docsrs/hypergraph?style=for-the-badge)

Hypergraph is a data structure library to generate **directed** [hypergraphs](https://en.wikipedia.org/wiki/Hypergraph).

A hypergraph is a generalization of a graph in which a hyperedge can join any number of vertices.

## Features

This library enables you to:

- represent **non-simple** hypergraphs with two or more hyperedges - with different weights - containing the exact same set of vertices
- represent **self-loops** - i.e., hyperedges containing vertices directed to themselves one or more times
- represent **unaries** - i.e., hyperedges containing a unique vertex

Additional features:

- Safe Rust implementation
- Proper error handling
- Stable indexes assigned for each hyperedge and each vertex

## Installation

Add this to your `Cargo.toml` (replace _current_version_ with the [latest version of the library](https://crates.io/crates/hypergraph)):

```toml
[dependencies]
hypergraph = "curent_version"
```

## Usage

Please read the [documentation](https://docs.rs/hypergraph) to get started.