pub struct LaidEdge {
pub from: String,
pub to: String,
pub class: EdgeClass,
pub via: Vec<String>,
pub hops: usize,
}Expand description
A laid-out edge: endpoints + classification + the via labels (empty for a synthesised transitive edge) + the shortest hop distance.
Fields§
§from: String§to: String§class: EdgeClass§via: Vec<String>Labels justifying a direct edge; empty for a synthesised transitive edge.
hops: usizeShortest hop distance from → to over direct edges (1 for direct, ≥2 for
transitive). Lets a renderer fade deeper hops.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for LaidEdge
impl RefUnwindSafe for LaidEdge
impl Send for LaidEdge
impl Sync for LaidEdge
impl Unpin for LaidEdge
impl UnsafeUnpin for LaidEdge
impl UnwindSafe for LaidEdge
Blanket Implementations§
impl<T> Allocation for T
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