//! Graph algorithms for finding connected components and cycles in arc graphs.
//!
//! This module provides algorithms for:
//! - Merging close endpoints of arcs to handle numerical precision issues
//! - Finding non-intersecting cycles in graphs of connected arcs
//! - Handling geometric constraints for tool path generation
// Re-export main functions
pub use merge_close_endpoints;
pub use find_non_intersecting_cycles;