solvr 0.2.0

Advanced computing library for real-world problem solving - optimization, differential equations, interpolation, statistics, and more
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

//! Graph algorithms for network analysis.
//!
//! This module provides production-ready graph algorithms including:
//! - Shortest paths (Dijkstra, Bellman-Ford, Floyd-Warshall, Johnson, A*)
//! - Minimum spanning tree (Kruskal)
//! - Connectivity (connected components, strongly connected components)
//! - Centrality (degree, betweenness, closeness, eigenvector, PageRank)
//! - Network flow (max flow, min cost flow)
//! - Graph matrices (Laplacian, adjacency, incidence)

mod cpu;
pub mod impl_generic;
pub mod traits;

#[cfg(feature = "cuda")]
mod cuda;

#[cfg(feature = "wgpu")]
mod wgpu;

pub use traits::*;