Struct meshed::graph::edge::Edge

pub struct Edge<T: GraphDefinition> {
    pub origin: Node<T>,
    pub target: Node<T>,
    pub meta: Rc<T::EdgeMeta>,
    pub graph_type: PhantomData<T>,
}

Fields

origin: Node<T>

target: Node<T>

meta: Rc<T::EdgeMeta>

graph_type: PhantomData<T>

Implementations

impl<T: GraphDefinition> Edge<T>

pub fn new(from: Node<T>, to: Node<T>, meta: Rc<T::EdgeMeta>) -> Self

Trait Implementations

impl<T: GraphDefinition> Clone for Edge<T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

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<T> Identifiable<EdgeIdentity<<T as GraphDefinition>::Id>> for Edge<T> where
    T: GraphDefinition, 

fn get_id(&self) -> EdgeIdentity<T::Id>

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: GraphDefinition> Ord for Edge<T>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<T: GraphDefinition> PartialEq<Edge<T>> for Edge<T>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<T: GraphDefinition> PartialOrd<Edge<T>> for Edge<T>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: GraphDefinition> Eq for Edge<T>