Struct LinkGraph 

pub struct LinkGraph { /* private fields */ }

A linked implementation of the DCEL trait

Implementations

impl LinkGraph

pub fn new() -> LinkGraph

Returns a new empty ListGraph

pub fn new_vertex(&mut self) -> LinkVertex

Adds a new vertex to this LinkGraph

pub fn new_dart( &mut self, from: LinkVertex, to: LinkVertex, prev: Option<LinkDart>, next: Option<LinkDart>, twin: Option<LinkDart>, face: Option<LinkFace>, ) -> LinkDart

Adds a new dart to this LinkGraph

pub fn new_face(&mut self, dart: LinkDart) -> LinkFace

Adds a new face to this LinkGraph

pub fn new_edge( &mut self, from: LinkVertex, to: LinkVertex, prev: Option<LinkDart>, next: Option<LinkDart>, face: Option<LinkFace>, twin_face: Option<LinkFace>, ) -> (LinkDart, LinkDart)

Adds an edge to the graph

pub fn remove_edge( &mut self, from: &LinkVertex, dart: LinkDart, ) -> (LinkDart, LinkDart)

Removes the given dart and its twin from the graph

pub fn validate(&self)

Validates the integrity of the graph. Panics if graph is invalid. Therefor mainly usefully for debugging.

pub fn auto_face(&mut self)

Automatically generates faces for the graph

Trait Implementations

impl Default for LinkGraph

fn default() -> Self

Returns the “default value” for a type.

impl Drop for LinkGraph

fn drop(&mut self)

Executes the destructor for this type.

impl Embedding<LinkVertex, LinkDart, LinkFace, LinkGraphIter<LinkVertex>, LinkGraphIter<LinkDart>, LinkGraphIter<LinkFace>, LinkGraph> for MaximalPlanar

fn embed(graph: StableGraph<(), (), Undirected>) -> LinkGraph

Receives a graph as an Argument an returns the embedding

impl GraphDCEL<LinkVertex, LinkDart, LinkFace, LinkGraphIter<LinkVertex>, LinkGraphIter<LinkDart>, LinkGraphIter<LinkFace>> for LinkGraph

fn get_vertexes(&self) -> LinkGraphIter<LinkVertex>

Returns all vertex in the graph as an iterator

fn get_darts(&self) -> LinkGraphIter<LinkDart>

Returns all darts in the graph as an iterator

fn get_faces(&self) -> LinkGraphIter<LinkFace>

Returns all faces in the graph as an iterator

fn vertex_count(&self) -> usize

Returns the number of vertexes in the graph

fn dart_count(&self) -> usize

Returns the number of darts in the graph

fn edge_count(&self) -> usize

Returns the number of edges in the graph

fn face_count(&self) -> usize

Returns the number of faces in the graph

fn face_vertex_count(&self, face: &LinkFace) -> usize

Returns the number of vertexes adjacent to the given face

fn neighbors_count(&self, vertex: &LinkVertex) -> usize

Returns the amount of vertex neighboring the given vertex

fn neighbors(&self, vertex: &LinkVertex) -> Vec<LinkVertex>

Returns a vector of neighbors of the given vertex

fn get_dart(&self, vertex: &LinkVertex, target: &LinkVertex) -> Option<LinkDart>

Returns the dart between to vertexes

fn dart_vertex(&self, vertex: &LinkVertex) -> LinkDart

Returns the dart linked to the given vertex

fn dart_face(&self, face: &LinkFace) -> LinkDart

Returns the the dart linked to the given face

fn twin(&self, dart: &LinkDart) -> LinkDart

Returns the twin dart of the given dart

fn dart_target(&self, dart: &LinkDart) -> LinkVertex

Returns the target vertex of the given dart

fn face(&self, dart: &LinkDart) -> LinkFace

Return the face adjacent to the given dart

fn next(&self, current: &LinkDart) -> LinkDart

Returns the next dart in the dart order

fn prev(&self, current: &LinkDart) -> LinkDart

Returns the previous dart in the dart order

fn add_vertex(&mut self) -> LinkVertex

Adds a new vertex

fn add_dart( &mut self, from: LinkVertex, to: LinkVertex, prev: Option<LinkDart>, next: Option<LinkDart>, twin: Option<LinkDart>, face: Option<LinkFace>, ) -> LinkDart

Adds a new dart

fn add_face(&mut self, dart: LinkDart) -> LinkFace

Adds a new face

fn set_face(&self, dart: &LinkDart, face: LinkFace)

Sets the face for the given Dart

fn vertex_by_id(&self, id: usize) -> Option<LinkVertex>

Returns a vertex specified by this id

impl<'a> GraphWalk<'a, LinkVertex, LinkDart> for LinkGraph

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

Returns all the nodes in this graph.

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

Returns all of the edges in this graph.

fn source(&'a self, edge: &LinkDart) -> LinkVertex

The source node for edge.

fn target(&'a self, edge: &LinkDart) -> LinkVertex

The target node for edge.

impl<'a> Labeller<'a, LinkVertex, LinkDart> for LinkGraph

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

Must return a DOT compatible identifier naming the graph.

fn node_id(&'a self, vertex: &LinkVertex) -> 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.