| Crates.io | icentral-scores |
| lib.rs | icentral-scores |
| version | 0.1.0 |
| created_at | 2025-04-04 21:04:51.219791+00 |
| updated_at | 2025-04-04 21:04:51.219791+00 |
| description | Rust crate for computing and managing betweenness centrality scores in network graphs via efficient algorithms and data structures. |
| homepage | |
| repository | |
| max_upload_size | |
| id | 1620753 |
| size | 59,111 |
icentral-scores is a Rust crate designed for calculating and managing betweenness centrality scores within network graphs. Betweenness centrality is a measure of a node's importance based on the number of shortest paths that pass through it within a network. This crate provides mechanisms to efficiently compute, update, and manage these scores to facilitate high-performance graph analysis.
MaybeIndexedMap to store and manage betweenness scores effectively with features like halving values or clearing all scores.Add the following to your Cargo.toml:
[dependencies]
icentral-scores = "0.1.0"
To start using icentral-scores, implement the provided traits in your application to handle betweenness score calculations and adjustments. Here is an example:
use icentral_scores::{BetweennessScores, CreateScoresVector};
fn main() {
// Example initialization of scores
let scores = BetweennessScores::new_from_graph_ref(&graph, "example_scores");
// Manipulate and access scores as needed
}
This README was generated by an AI model and may not be 100% accurate, though it strives to be detailed and useful.
This project is licensed under the MIT License.
This crate is in the process of being translated from c++ to rust. Currently, it still needs exhaustive testing. It is likely there currently exist many glitches which need to be fixed before proper usage. This crate is based on the original icentral program developed by Fuad Jamor. Please see the following repository for details: https://github.com/fjamour/icentral.
For progress updates, see the workspacer rust project.