Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class DimensionChecker
Note: This documentation is automatically generated.
This checker enforces dimension requirements.
A dimension requires that there is some valuation of
cumul and demand such that for all paths:
- cumul[A] is in interval node_capacity[A]
- if arc A -> B is on a path of path_class p,
then cumul[A] + demand[p](A, B) = cumul[B].
- if A is on a path of class p, then
cumul[A] must be inside interval path_capacity[path].
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["The DimensionChecker enforces constraints on cumulative values and demands along paths in a network."],["It ensures that cumulative values at nodes are within specified capacity intervals for both nodes and paths."],["The checker verifies feasibility based on changes in path states and demand, requiring specific conditions to be met for paths and nodes."],["It provides methods to check feasibility and commit changes, interacting with the PathState object for constraint management."]]],["The `DimensionChecker` class enforces dimension requirements based on `cumul` and `demand`. It ensures that for all paths, `cumul[A]` is within `node_capacity[A]`, and if arc `A -\u003e B` is on a path of class `p`, then `cumul[A] + demand[p](A, B) = cumul[B]`. `cumul[A]` must also be inside `path_capacity[path]`. The `Check` method verifies feasibility after changes, and `Commit` applies changes made to `PathState`. The constructor takes various capacity and demand parameters.\n"]]
