Show HN: Hypergraph – directed hypergraph library in Rust (40 graph algorithms)
Hypergraph is a Rust library designed for generating directed hypergraphs, which are a generalization of traditional graphs. This library provides methods for modeling complex relational data and offers various graph algorithms for analysis. Key features include support for non-simple hypergraphs, self-loops, and a generic query interface for graph operations.
- ▪Hypergraph allows modeling of complex, multiway relational data.
- ▪The library supports various graph algorithms including BFS, DFS, and Dijkstra's shortest path.
- ▪It provides functionalities for structural analysis and filtered views of hypergraphs.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/yamafaktory/hypergraph |
| Publication time | Mon, 25 May 2026 19:04:18 +0000 |
| Retrieval time | 2026-05-25T19:07:40.295Z |
| Last seen | 2026-05-25T19:07:40.295Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | hT5rMjPY6JLh |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Hypergraph is a data structure library to generate directed hypergraphs. A hypergraph is a generalization of a graph in which a hyperedge can join any number of vertices. 📣 Goal This library aims at providing the necessary methods for modeling complex, multiway (non-pairwise) relational data found in complex networks. One of the main advantages of using a hypergraph model over a graph one is to provide a more flexible and natural framework to represent entities and their relationships (e.g. Alice uses some social network, shares some data to Bob, who shares it to Carol, etc).
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.