spectral_fleet/lib.rs
1//! # spectral-fleet
2//!
3//! Spectral graph theory applied to AI agent fleet analysis and optimization.
4//!
5//! A fleet is modeled as a graph where nodes are agents and edges are
6//! communication/dependency channels. Spectral analysis of the graph
7//! Laplacian reveals hidden structure:
8//!
9//! - **Number of clusters**: count of zero eigenvalues
10//! - **Connectivity**: spectral gap
11//! - **Bottleneck**: Fiedler value (algebraic connectivity)
12//!
13//! # Modules
14//!
15//! - `fleet_graph`: Fleet as a directed weighted graph
16//! - `laplacian`: Graph Laplacian and eigenvalue decomposition
17//! - `clustering`: Spectral clustering of agents
18//! - `bottleneck`: Bottleneck detection and bypass suggestions
19//! - `reorganization`: Fleet reorganization optimization
20//! - `dynamics`: Temporal evolution and phase transitions
21//! - `embedding`: Spectral embedding for visualization
22
23pub mod fleet_graph;
24pub mod laplacian;
25pub mod clustering;
26pub mod bottleneck;
27pub mod reorganization;
28pub mod dynamics;
29pub mod embedding;
30
31pub use fleet_graph::{AgentNode, CommEdge, FleetGraph};
32pub use laplacian::Spectrum;
33pub use clustering::FleetCluster;
34pub use reorganization::Reorganization;