icentral-operation-update

icentral-operation-update is a Rust crate designed to efficiently update betweenness centrality (BC) scores in large graph structures. This crate is implemented with a focus on handling both connected and biconnected components of a graph efficiently. The primary feature of this library is its capacity to manage the centrality recalibration of nodes during edge insertions and deletions, minimizing computational overheads.

Functional Overview

This crate includes the core functionality to update BC scores, which are critical for understanding the importance of vertices in network analysis. It leverages parallel processing and specialized algorithms for recalibrating the edge betweenness centrality when the graph undergoes modifications. These operations are crucial for applications requiring real-time or dynamic graph topology adjustments, such as network analysis, optimization, and scientific computations.

Major Operations

• Betweenness Centrality Update: Automatically updates BC scores based on graph mutations.
• Biconnected Component Management: Handles edge applications specifically within biconnected components.
• Graph Operations: Executes efficient graph operations considering graph and component-specific attributes.

Usage

Below are the main interfaces provided by the crate:

pub fn update_bc_for_graph<GH>(scores: &mut BetweennessScores, graph: &Graph<GH>, comp_type: CompType, mut edge: Edge, num_threads: usize, op: Operation) -> Result<(), BetweennessCentralityError>;

pub fn execute_biconnected_component_update_operation<GH>(graph: &mut Graph<GH>, component: &mut Component, edge: &mut Edge, op: &Operation);

pub fn update_bc_for_biconnected_component<GH>(scores: &mut BetweennessScores, graph: &mut Graph<GH>, comp_type: CompType, mut edge: Edge, num_threads: usize, op: Operation) -> Result<(), BetweennessCentralityError>;

pub fn update_bc<GH>(scores: &mut BetweennessScores, graph: &mut Graph<GH>, comp_type: CompType, mut edge: Edge, num_threads: Option<usize>, op: Option<Operation>) -> Result<(), BetweennessCentralityError>;

The functions leverage multithreading to optimize the performance, especially with large data sets, and handle component-specific nuances to ensure robustness.

Performance Considerations

With algorithmic processing optimized for parallel execution, the crate can deal with complex, large-scale graphs while ensuring low latency during updates.

Installation

Add the following to your Cargo.toml:

[dependencies]
icentral-operation-update = "0.1.0"

License

icentral-operation-update is released under the MIT License. See LICENSE file for details.

Disclaimer

This README.md file was generated by an AI model and may not be 100% accurate, although it should be quite useful.

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.