rmpca 0.1.1

Enterprise-grade route optimization engine — Chinese Postman Problem solver with Eulerian circuit detection, Lean 4 FFI boundary, and property-based testing
Documentation
//! rmpca — Enterprise-grade route optimization library
//!
//! This library provides the core optimization algorithms and data structures
//! for solving the Chinese Postman Problem (CPP) and finding Eulerian circuits
//! in road networks. It is designed for use with the `rmpca` CLI binary and
//! can also be used as a standalone library.
//!
//! # Key Types
//!
//! - [`optimizer::RouteOptimizer`] — Main entry point for route optimization
//! - [`optimizer::GraphBuilder`] — Builder for constructing graphs from `GeoJSON`
//! - [`optimizer::EulerianSolver`] — Eulerian circuit detection and solving
//! - [`optimizer::RouteError`] — Domain-specific error type (thiserror-based)
//! - [`optimizer::types`] — Core types: `Node`, `Way`, `RoutePoint`, `OptimizationResult`
//!
//! # Example
//!
//! ```no_run
//! use rmpca::optimizer::RouteOptimizer;
//!
//! let mut optimizer = RouteOptimizer::new();
//! // Build graph, optimize route, etc.
//! ```

pub mod commands;
pub mod config;
pub mod geo;
pub mod map;
pub mod optimizer;
pub mod osm;