Struct graphannis_core::graph::storage::adjacencylist::AdjacencyListStorage [−][src]
pub struct AdjacencyListStorage { /* fields omitted */ }
Implementations
Trait Implementations
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Get all outgoing edges for a given node
.
Return true of the given node has any outgoing edges.
Get all incoming edges for a given node
.
Provides an iterator over all nodes of this edge container that are the source of an edge
Get the annotation storage for the edges of this graph storage.
Return an identifier for this graph storage which is used to distinguish the different graph storages when (de-) serialized.
Load the graph storage from a location
on the disk. This location is a directory, which can contain files specific to this graph storage.
Save the graph storage a location
on the disk. This location must point to an existing directory.
Find all nodes reachable from a given start node inside the component.
Find all nodes reachable from a given start node inside the component, when the directed edges are inversed.
Compute the distance (shortest path length) of two nodes inside this component.
Check if two nodes are connected with any path in this component given a minimum (min_distance
) and maximum (max_distance
) path length.
fn copy(
&mut self,
_node_annos: &dyn AnnotationStorage<NodeID>,
orig: &dyn GraphStorage
) -> Result<()>
fn copy(
&mut self,
_node_annos: &dyn AnnotationStorage<NodeID>,
orig: &dyn GraphStorage
) -> Result<()>
Copy the content of another component. This removes the existing content of this graph storage. Read more
Try to downcast this graph storage to a WriteableGraphStorage trait.
Returns None
if this graph storage is not writable. Read more
Upcast this graph storage to the EdgeContainer trait.
If true, finding the inverse connected nodes via find_connected_inverse(…) has the same cost as the non-inverse case.
Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself. Read more
Add an annotation to an edge in this graph storage. The edge has to exist. Read more
Delete an existing edge.
Delete the annotation (defined by the qualified annotation name in anno_key
) for an edge
.
Delete a node from this graph storage. This deletes both edges edges where the node is the source or the target node. Read more
Re-calculate the statistics of this graph storage.
Auto Trait Implementations
impl RefUnwindSafe for AdjacencyListStorage
impl Send for AdjacencyListStorage
impl Sync for AdjacencyListStorage
impl Unpin for AdjacencyListStorage
impl UnwindSafe for AdjacencyListStorage
Blanket Implementations
Mutably borrows from an owned value. Read more