Expand description
Reduction rules between NP-hard problems.
Re-exports§
pub use cost::CustomCost;pub use cost::Minimize;pub use cost::MinimizeSteps;pub use cost::PathCostFn;pub use registry::ReductionEntry;pub use registry::ReductionOverhead;
Modules§
- analysis
- Analysis utilities for the reduction graph.
- cost
- Cost functions for reduction path optimization.
- registry
- Automatic reduction registration via inventory.
- unitdiskmapping
- Graph to grid graph mapping.
Structs§
- Neighbor
Info - Information about a neighbor in the reduction graph.
- Neighbor
Tree - A tree node for neighbor traversal results.
- Reduction
Auto Cast - Generic reduction result for natural-edge (subtype) reductions.
- Reduction
Chain - A composed reduction chain produced by
ReductionGraph::reduce_along_path. - Reduction
Edge Info - A source/target pair from the reduction graph, returned by
ReductionGraph::outgoing_reductionsandReductionGraph::incoming_reductions. - Reduction
Graph - Runtime graph of all registered reductions.
- Reduction
Path - A path through the variant-level reduction graph.
- Reduction
Step - A node in a variant-level reduction path.
Enums§
- Traversal
Direction - Direction for graph traversal.
Traits§
- Reduce
To - Trait for problems that can be reduced to target type T.
- Reduction
Result - Result of reducing a source problem to a target problem.