pub struct SimpleGraph {
pub nodes: Vec<GElem>,
pub edges: Vec<GElem>,
pub g_dir: Vec<(GNodeId, GEdgeId, GNodeId)>,
pub g_undir: Vec<(GNodeId, GEdgeId, GNodeId)>,
pub labels: RodeoReader,
}
Expand description
A ‘simple’ graph of nodes and edges in both directed and undirected graphs.
Fields§
§nodes: Vec<GElem>
§edges: Vec<GElem>
§g_dir: Vec<(GNodeId, GEdgeId, GNodeId)>
§g_undir: Vec<(GNodeId, GEdgeId, GNodeId)>
§labels: RodeoReader
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for SimpleGraph
impl !RefUnwindSafe for SimpleGraph
impl !Send for SimpleGraph
impl !Sync for SimpleGraph
impl Unpin for SimpleGraph
impl !UnwindSafe for SimpleGraph
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> 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