Struct GraphAnalytics 

pub struct GraphAnalytics { /* private fields */ }

Graph analytics engine

Implementations

impl GraphAnalytics

pub fn new(edges: Vec<(String, String, f32)>) -> Self

Create analytics engine from edges

Arguments

• edges - List of (source, target, weight) tuples

pub fn detect_communities(&self) -> Vec<Community>

Detect communities using Louvain algorithm

This is a simplified implementation. Full Louvain requires iterative optimization.

Returns

List of detected communities

pub fn calculate_centrality(&self) -> HashMap<String, CentralityScores>

Calculate centrality scores for all nodes

Returns

Map of node ID to centrality scores

pub fn shortest_path(&self, start: &str, end: &str) -> Option<Path>

Find shortest path between two nodes (Dijkstra’s algorithm)

Arguments

• start - Starting node ID
• end - Ending node ID

Returns

Shortest path if exists

pub fn all_paths(&self, start: &str, end: &str, max_depth: usize) -> Vec<Path>

Find all paths between two nodes (limited depth)

Arguments

• start - Starting node
• end - Ending node
• max_depth - Maximum path length

Returns

All paths up to max_depth

pub fn top_degree_nodes(&self, top_k: usize) -> Vec<(String, f32)>

Get nodes with highest degree centrality

Arguments

• top_k - Number of top nodes to return

Returns

List of (node_id, degree_centrality) sorted by degree

pub fn density(&self) -> f32

Get graph density

Returns

Graph density (0.0 to 1.0)

pub fn clustering_coefficient(&self) -> f32

Get clustering coefficient

Returns

Average clustering coefficient