pub struct GraphPartition {
pub device: DeviceInfo,
pub nodes: Vec<NodeIndex>,
pub local_edges: Vec<(NodeIndex, NodeIndex)>,
pub communication_edges: Vec<CommunicationEdge>,
pub estimated_memory: usize,
pub estimated_compute_time: f64,
}Expand description
Graph partition representation
Fields§
§device: DeviceInfo§nodes: Vec<NodeIndex>§local_edges: Vec<(NodeIndex, NodeIndex)>§communication_edges: Vec<CommunicationEdge>§estimated_memory: usize§estimated_compute_time: f64Trait Implementations§
Source§impl Clone for GraphPartition
impl Clone for GraphPartition
Source§fn clone(&self) -> GraphPartition
fn clone(&self) -> GraphPartition
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for GraphPartition
impl RefUnwindSafe for GraphPartition
impl Send for GraphPartition
impl Sync for GraphPartition
impl Unpin for GraphPartition
impl UnsafeUnpin for GraphPartition
impl UnwindSafe for GraphPartition
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more