Struct NaiveTaggedGraph

pub struct NaiveTaggedGraph<V, E, G = TreeBackedGraph>
where
    V: Hash + Eq + Clone,
    E: Hash + Eq + Clone,
{ /* private fields */ }

A naive implementation of tagged graphs.

Trait Implementations

impl<V, E, G: Clone> Clone for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone + Clone, E: Hash + Eq + Clone + Clone,

fn clone(&self) -> NaiveTaggedGraph<V, E, G>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<V, E, G> Default for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone + Edge, G: GrowableGraph,

fn default() -> Self

Returns the “default value” for a type.

impl<V, E, G> DirectedOrNot for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone, G: DirectedOrNot,

const DIRECTED_OR_NOT: bool = G::DIRECTED_OR_NOT

When the graph is directed, it is true; otherwise, it is false.

impl<V, E, G> EdgeShrinkableTaggedGraph for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone + Edge, G: EdgeShrinkableGraph,

fn remove_edge(&mut self, eid: &EdgeId) -> Option<Self::Edge>

Removes an edge and returns it if it is present.

impl<V, E, G> GrowableTaggedGraph for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone + Edge, G: GrowableGraph,

fn new() -> Self

Creates an empty graph.

fn overwrite_vertex(&mut self, vert: Self::Vertex) -> VertexId

Inserts a vertex if it is unpresent or updates the one with a same VertexId.

fn add_edge(&mut self, edge: Self::Edge) -> EdgeId

Adds an edge and returns its EdgeId.

fn update_edge(&mut self, eid: EdgeId, new: Self::Edge)

Updates an edge w.r.t. its EdgeId.

impl<V, E, G> QueryableTaggedGraph for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone + Edge, G: QueryableGraph,

fn vertex_size(&self) -> usize

Total number of vertices.

fn iter_vertices( &self, ) -> Box<dyn Iterator<Item = (VertexId, &Self::Vertex)> + '_>

Iterates over vertices without any specific order.

fn edge_size(&self) -> usize

Total number of edges.

fn iter_edges(&self) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>

Iterates edges without any specific order.

fn edges_connecting( &self, source: &VertexId, sink: &VertexId, ) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>

Iterates edges connecting two specified endpoints.

fn in_edges( &self, vid: &VertexId, ) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>

Iterates over in-edges of a specified vertex.

fn out_edges( &self, vid: &VertexId, ) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>

Iterates over out-edges of a specified vertex.

impl<V, E, G> TaggedGraph for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone + Edge,

type LowerGraph = G

type of underlying low-level graph

type Vertex = V

customized vertex type

type Edge = E

customized edge type

fn lower_graph(&self) -> &Self::LowerGraph

fn vertex_by_id(&self, vid: &VertexId) -> Option<&Self::Vertex>

fn id_by_vertex(&self, vert: &Self::Vertex) -> Option<VertexId>

fn edge_by_id(&self, eid: &EdgeId) -> Option<&Self::Edge>

fn id_by_edge(&self, edge: &Self::Edge) -> Option<EdgeId>

fn contains_vertex_by_id(&self, vid: &VertexId) -> bool

fn contains_vertex(&self, vert: &Self::Vertex) -> bool

fn contains_edge_by_id(&self, eid: &EdgeId) -> bool

fn contains_edge(&self, edge: &Self::Edge) -> bool

impl<V, E, G> VertexShrinkableTaggedGraph for NaiveTaggedGraph<V, E, G>

where V: Hash + Eq + Clone, E: Hash + Eq + Clone + Edge, G: VertexShrinkableGraph,

fn remove_vertex( &mut self, vid: &VertexId, ) -> Box<dyn Iterator<Item = (EdgeId, Self::Edge)> + '_>

Removes a vertex and edges connecting to it and returns these edges.