Crate graphina 

Graphina

A graph data science library for Rust with a high-level API.

Extension (or Module) Overview

• core – Core graph types, builders, IO, serialization, etc. (core is always enabled.)
• centrality (feature: centrality) – Node and edge importance measures.
• community (feature: community) – Community detection and clustering.
• links (feature: links) – Link prediction algorithms.
• metrics (feature: metrics) – Graph and node metrics (like diameter, radius, etc.).
• mst (feature: mst) – Minimum spanning tree algorithms.
• traversal (feature: traversal) – BFS, DFS, and related traversal algorithms.
• approximation (feature: approximation) – Algorithms for computationally hard graph problems.
• parallel (feature: parallel) – Parallel implementations for a subset of algorithms.
• subgraphs (feature: subgraphs) – Algorithms for induced subgraph and ego network.

API Conventions

Most algorithm implementations return Result<_, graphina::core::error::GraphinaError> for error handling.

Enable only required features to minimize binary size and compile time.

Modules

approximationapproximation

Algorithms for computationally hard graph problems.

centralitycentrality

Node and edge centrality algorithms.

communitycommunity

Community detection and graph clustering algorithms.

core

Core graph data types and utilities.

linkslinks

Link prediction algorithms.

metricsmetrics

Graph metrics and related algorithms.

mstmst

Minimum spanning tree algorithms.

parallelparallel

Parallel implementations of some of the algorithms.

subgraphssubgraphs

Algorithms related to induced subgraph and ego network.

traversaltraversal

Graph traversal algorithms.