Struct meshed::graph::ConcreteGraph

pub struct ConcreteGraph<T> where
    T: GraphDefinition, { /* private fields */ }

Implementations

impl<T> ConcreteGraph<T> where
    T: GraphDefinition, 

pub fn all_nodes(&self) -> impl Iterator<Item = Node<T>> + '_

pub fn all_edges(&self) -> impl Iterator<Item = Edge<T>> + '_

pub fn order(&self) -> usize

impl<T> ConcreteGraph<T> where
    T: GraphDefinition, 

pub fn invert(&self) -> Inverted<T>

impl ConcreteGraph<T>

pub fn insert_node(
    &mut self,
    node_id: <SimpleGraphDefinition as GraphDefinition>::Id
)

pub fn insert_edge(
    &mut self,
    from: <SimpleGraphDefinition as GraphDefinition>::Id,
    to: <SimpleGraphDefinition as GraphDefinition>::Id
)

Trait Implementations

impl<T: GraphDefinition> Default for ConcreteGraph<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> FromIterator<Node<T>> for ConcreteGraph<T> where
    T: GraphDefinition, 

fn from_iter<I: IntoIterator<Item = Node<T>>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a, T: GraphDefinition> GraphWalk<'a, Node<T>, Edge<T>> for ConcreteGraph<T>

fn nodes(&'a self) -> Nodes<'a, Node<T>>

Returns all the nodes in this graph.

fn edges(&'a self) -> Edges<'a, Edge<T>>

Returns all of the edges in this graph.

fn source(&'a self, edge: &Edge<T>) -> Node<T>

The source node for edge.

fn target(&'a self, edge: &Edge<T>) -> Node<T>

The target node for edge.

impl<'a, T: GraphDefinition> IntoIterator for &'a ConcreteGraph<T>

type Item = Node<T>

The type of the elements being iterated over.

type IntoIter = <Vec<<&'a ConcreteGraph<T> as IntoIterator>::Item, Global> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T: GraphDefinition> Labeller<'a, Node<T>, Edge<T>> for ConcreteGraph<T>

fn graph_id(&'a self) -> Id<'a>

Must return a DOT compatible identifier naming the graph.

fn node_id(&'a self, n: &Node<T>) -> Id<'a>

Maps n to a unique identifier with respect to self. The implementer is responsible for ensuring that the returned name is a valid DOT identifier.

fn node_shape(&'a self, _node: &N) -> Option<LabelText<'a>>

Maps n to one of the graphviz shape names. If None is returned, no shape attribute is specified.

fn node_label(&'a self, n: &N) -> LabelText<'a>

Maps n to a label that will be used in the rendered output. The label need not be unique, and may be the empty string; the default is just the output from node_id.

fn edge_label(&'a self, e: &E) -> LabelText<'a>

Maps e to a label that will be used in the rendered output. The label need not be unique, and may be the empty string; the default is in fact the empty string.

fn node_style(&'a self, _n: &N) -> Style

Maps n to a style that will be used in the rendered output.

fn node_color(&'a self, _node: &N) -> Option<LabelText<'a>>

Maps n to one of the graphviz color names. If None is returned, no color attribute is specified.

fn edge_end_arrow(&'a self, _e: &E) -> Arrow

Maps e to arrow style that will be used on the end of an edge. Defaults to default arrow style.

fn edge_start_arrow(&'a self, _e: &E) -> Arrow

Maps e to arrow style that will be used on the end of an edge. Defaults to default arrow style.

fn edge_style(&'a self, _e: &E) -> Style

Maps e to a style that will be used in the rendered output.

fn edge_color(&'a self, _e: &E) -> Option<LabelText<'a>>

Maps e to one of the graphviz color names. If None is returned, no color attribute is specified.

fn kind(&self) -> Kind

The kind of graph, defaults to Kind::Digraph.

impl<T> Query<<T as GraphDefinition>::Id, Node<T>> for ConcreteGraph<T> where
    T: GraphDefinition, 

fn query(&self, identifier: &T::Id) -> Option<&Node<T>>

fn all(&self) -> Vec<&Node<T>>

fn create_index(&self) -> HashMap<I, Link<'_, I, V>>