pub struct Volumes {
pub links: HashMap<String, HashMap<String, f64>>,
pub nodes: HashMap<String, f64>,
}Expand description
Volumes holds the assigned demand according to the optimal strategy.
Fields§
§links: HashMap<String, HashMap<String, f64>>Link volumes: links[from_node][to_node] = flow
nodes: HashMap<String, f64>Node volumes: accumulated flow through each node
Auto Trait Implementations§
impl Freeze for Volumes
impl RefUnwindSafe for Volumes
impl Send for Volumes
impl Sync for Volumes
impl Unpin for Volumes
impl UnsafeUnpin for Volumes
impl UnwindSafe for Volumes
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more