Struct Node

pub struct Node<I: Index, NL: Label> {
    pub id: I,
    pub label: NL,
}

Represents a single Node. It has an identifier and an optional label, which can be removed by using the zero-sized type ()

Fields

id: I

label: NL

Implementations

impl<I: Index, NL: Label> Node<I, NL>

pub fn new(id: I, label: NL) -> Self

Create a new Node with an id, that is used to differentiate/identify the node which has therefore to be unique and a label, which determines the ‘type’.

pub fn is_isomorph_to(&self, n: &Self) -> bool

Checks if the node has the same label as the other node n.

Trait Implementations

impl<I: Clone + Index, NL: Clone + Label> Clone for Node<I, NL>

fn clone(&self) -> Node<I, NL>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Index, NL: Debug + Label> Debug for Node<I, NL>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, I, NL> Deserialize<'de> for Node<I, NL>

where I: Deserialize<'de> + Index, NL: Deserialize<'de> + Label,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, I: Index, NL: Label, EL: Label> GraphWalk<'a, Node<I, NL>, Edge<I, EL>> for Graph<I, NL, EL>

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

Returns all the nodes in this graph.

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

Returns all of the edges in this graph.

fn source(&self, e: &Edge<I, EL>) -> Node<I, NL>

The source node for edge.

fn target(&self, e: &Edge<I, EL>) -> Node<I, NL>

The target node for edge.

impl<'a, I: Index, NL: Label, EL: Label> Labeller<'a, Node<I, NL>, Edge<I, EL>> for Graph<I, NL, EL>

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

Must return a DOT compatible identifier naming the graph.

fn node_id(&'a self, n: &Node<I, NL>) -> 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<I: PartialEq + Index, NL: PartialEq + Label> PartialEq for Node<I, NL>

fn eq(&self, other: &Node<I, NL>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I, NL> Serialize for Node<I, NL>

where I: Serialize + Index, NL: Serialize + Label,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<I: Index, NL: Label> StructuralPartialEq for Node<I, NL>