| Crates.io | icentral-speedup-calculation |
| lib.rs | icentral-speedup-calculation |
| version | 0.1.0 |
| created_at | 2025-04-04 23:22:55.920327+00 |
| updated_at | 2025-04-04 23:22:55.920327+00 |
| description | Rust library for efficient graph traversal and speedup calculations using Betweenness Centrality and MUC detection techniques. |
| homepage | |
| repository | |
| max_upload_size | |
| id | 1621004 |
| size | 73,535 |
icentral-speedup-calculation is a Rust library designed to perform precise and efficient calculations of ideal speedup in graph-related operations. It leverages sophisticated graph-theoretic concepts, focusing on Betweenness Centrality and Minimum Union Cycle (MUC) detection to optimize algorithmic performance.
This library primarily focuses on graph optimizations:
Optimal speedup computation involves comparisons between complete and partial graph structures, optimizing the node and edge ratio to ascertain efficiency improvements. This is crucial for speeding up computations in dense graphs or networks.
Add the following to your Cargo.toml:
[dependencies]
icentral-speedup-calculation = "0.1.0"
Use in your Rust code as follows:
use icentral_speedup_calculation::{fuad_ideal_speedup, ...};
fn main() {
let speedup = fuad_ideal_speedup(0.5, 30.0, 20.0, 40.0, 50.0, 1.5);
println!("Ideal Speedup: {:?}", speedup);
}
This README.md file was generated by an AI model and may not be 100% accurate. However, it should be pretty good.
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.