pub enum Query {
NodeID(usize),
EdgeID(usize),
Directed(DirectedEdge),
Undirected(UndirectedEdge),
Indeterminate(IndeterminateEdge),
}
Expand description
Variants§
NodeID(usize)
EdgeID(usize)
No need to remove anything
Directed(DirectedEdge)
Removed one node, return the node id
Undirected(UndirectedEdge)
Removed two nodes, return these node ids
Indeterminate(IndeterminateEdge)
Account for the fact that the graph is dynamic
Implementations§
Source§impl Query
impl Query
Sourcepub fn as_entry(&self) -> GraphEntry
pub fn as_entry(&self) -> GraphEntry
Sourcepub fn check_node_range(index: usize, count: usize) -> Result<usize, GraphError>
pub fn check_node_range(index: usize, count: usize) -> Result<usize, GraphError>
Returns the node as a node ID.
Sourcepub fn check_edge_range(index: usize, count: usize) -> Result<usize, GraphError>
pub fn check_edge_range(index: usize, count: usize) -> Result<usize, GraphError>
Returns the node as a node ID.
Trait Implementations§
impl Copy for Query
Auto Trait Implementations§
impl Freeze for Query
impl RefUnwindSafe for Query
impl Send for Query
impl Sync for Query
impl Unpin for Query
impl UnwindSafe for Query
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