Expand description
Performance optimizations for large graph operations
This module provides performance-optimized algorithms and data structures specifically designed for handling large graphs efficiently.
Modules§
- simd_
ops - Non-x86_64 fallback implementations
Structs§
- Large
Graph Iterator - Memory-efficient iterator for large graph traversals
- Lazy
Graph Metric - Lazy evaluation wrapper for expensive graph computations
- Memory
Metrics - Performance-focused memory profiling metrics
- Parallel
Config - Configuration for parallel processing
- Performance
Monitor - Performance monitoring utilities with enhanced memory profiling
- Performance
Report - Comprehensive performance report
- Real
Time Memory Profiler - Real-time memory profiler for graph operations
- Streaming
Graph Processor - Streaming algorithm for processing very large graphs
Traits§
- Large
Graph Ops - Optimized graph algorithms trait for large graphs
Functions§
- cache_
friendly_ adjacency_ matrix - Cache-friendly adjacency matrix computation for large graphs
- parallel_
degree_ computation - Parallel degree computation for large graphs
- parallel_
shortest_ paths - Memory-efficient parallel shortest path computation