{"id":13636881,"url":"https://github.com/yamafaktory/hypergraph","last_synced_at":"2025-05-15T08:07:34.743Z","repository":{"id":37980505,"uuid":"302162436","full_name":"yamafaktory/hypergraph","owner":"yamafaktory","description":"Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.","archived":false,"fork":false,"pushed_at":"2024-11-19T10:41:35.000Z","size":343,"stargazers_count":301,"open_issues_count":2,"forks_count":12,"subscribers_count":4,"default_branch":"main","last_synced_at":"2025-04-14T12:18:07.178Z","etag":null,"topics":["data","data-science","data-structure","data-structures","hypergraph","hypergraphs","rust","rust-lang","rustlang"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/yamafaktory.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE-MIT","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-10-07T21:17:13.000Z","updated_at":"2025-04-09T16:45:46.000Z","dependencies_parsed_at":"2023-01-29T19:15:56.824Z","dependency_job_id":"4e855cb0-b389-40d2-ac99-e5cf87396a13","html_url":"https://github.com/yamafaktory/hypergraph","commit_stats":{"total_commits":105,"total_committers":2,"mean_commits":52.5,"dds":0.00952380952380949,"last_synced_commit":"80f1cdde2b31c016c5eb4048eb54bca3826d1d79"},"previous_names":[],"tags_count":35,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yamafaktory%2Fhypergraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yamafaktory%2Fhypergraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yamafaktory%2Fhypergraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yamafaktory%2Fhypergraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yamafaktory","download_url":"https://codeload.github.com/yamafaktory/hypergraph/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248877967,"owners_count":21176244,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["data","data-science","data-structure","data-structures","hypergraph","hypergraphs","rust","rust-lang","rustlang"],"created_at":"2024-08-02T00:01:06.847Z","updated_at":"2025-05-15T08:07:34.733Z","avatar_url":"https://github.com/yamafaktory.png","language":"Rust","readme":"![graph](hypergraph.svg)\n\n---\n\n[\u003cimg alt=\"GitHub Workflow Status\" src=\"https://img.shields.io/github/actions/workflow/status/yamafaktory/hypergraph/ci.yml?branch=main\u0026logo=github\u0026style=flat-square\"\u003e](https://github.com/yamafaktory/hypergraph/actions/workflows/ci.yml) [\u003cimg alt=\"Crates.io\" src=\"https://img.shields.io/crates/v/hypergraph?style=flat-square\"\u003e](https://crates.io/crates/hypergraph/versions?sort=semver) [\u003cimg alt=\"docs.rs\" src=\"https://img.shields.io/docsrs/hypergraph?style=flat-square\"\u003e](https://docs.rs/hypergraph)\n\nHypergraph is a data structure library to generate **directed** [hypergraphs](https://en.wikipedia.org/wiki/Hypergraph).\n\nA hypergraph is a generalization of a graph in which a hyperedge can join any number of vertices.\n\n## 📣 Goal\n\nThis library aims at providing the necessary methods for modeling complex, multiway (non-pairwise) relational data found in complex networks.\nOne 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).\n\n## 🎁 Features\n\nThis library enables you to represent:\n\n- **non-simple** hypergraphs with two or more hyperedges - with different weights - containing the exact same set of vertices\n- **self-loops** - i.e., hyperedges containing vertices directed to themselves one or more times\n- **unaries** - i.e., hyperedges containing a unique vertex\n\n## ⚗️ Implementation\n\n- 100% safe Rust\n- Proper error handling\n- Stable indexes assigned for each hyperedge and each vertex\n- Parallelism (with Rayon)\n\n## 🛠️ Installation\n\nAdd this to your `Cargo.toml` (replace _current_version_ with the [latest version of the library](https://crates.io/crates/hypergraph)):\n\n```toml\n[dependencies]\nhypergraph = \"current_version\"\n```\n\n## ⚡️ Usage\n\nPlease read the [documentation](https://docs.rs/hypergraph) to get started.\n","funding_links":[],"categories":["Libraries","库 Libraries","rust"],"sub_categories":["Data structures","数据结构 Data structures"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyamafaktory%2Fhypergraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyamafaktory%2Fhypergraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyamafaktory%2Fhypergraph/lists"}