Trait QueryableTaggedGraph

pub trait QueryableTaggedGraph: TaggedGraph
where
    Self::LowerGraph: QueryableGraph,
{
    // Required methods
    fn vertex_size(&self) -> usize;
    fn iter_vertices(
        &self,
    ) -> Box<dyn Iterator<Item = (VertexId, &Self::Vertex)> + '_>;
    fn edge_size(&self) -> usize;
    fn iter_edges(&self) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>;
    fn edges_connecting(
        &self,
        source: &VertexId,
        sink: &VertexId,
    ) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>;
    fn in_edges(
        &self,
        vid: &VertexId,
    ) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>;
    fn out_edges(
        &self,
        vid: &VertexId,
    ) -> Box<dyn Iterator<Item = (Edge, &Self::Edge)> + '_>;
}

Interfaces to query vertices and edges in tagged graphs.

Required Methods

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.

Implementors

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

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