Struct SimpleGraph

pub struct SimpleGraph<N, E> { /* private fields */ }

A simple graph representation that is inefficient to use, but cheap to construct.

For actual usage, the graph should be converted into a different representation.

Trait Implementations

impl<N: Debug, E: Debug> Debug for SimpleGraph<N, E>

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

Formats the value using the given formatter.

impl<N, E> Default for SimpleGraph<N, E>

fn default() -> Self

Returns the “default value” for a type.

impl<N: Clone, E: Clone> From<&AdjacencyArray<N, E>> for SimpleGraph<N, E>

fn from(source: &AdjacencyArray<N, E>) -> Self

Converts to this type from the input type.

impl<N: Clone, E: Default + Clone> From<&SimpleGraph<N, E>> for AdjacencyArray<N, E>

fn from(source: &SimpleGraph<N, E>) -> Self

Converts to this type from the input type.

impl<N, E> Graph<N, E> for SimpleGraph<N, E>

type NodeIdIterator = Map<Range<u32>, fn(u32) -> NodeId>

An iterator over all node ids of a graph.

type EdgeIdIterator = Map<Range<u32>, fn(u32) -> EdgeId>

An iterator over all edge ids of a graph.

fn node_len(&self) -> IdType

The amount of nodes in the graph.

fn edge_len(&self) -> IdType

The amount of edges in the graph.

fn node_id_iter(&self) -> Self::NodeIdIterator

Returns an iterator over all node ids in the graph.

fn edge_id_iter(&self) -> Self::EdgeIdIterator

Returns an iterator over all edge ids in the graph.

fn node_data(&self, id: NodeId) -> &N

Returns a reference to a nodes data, identified by the given id.

fn edge_data(&self, id: EdgeId) -> &E

Returns a reference to an edges data, identified by the given id.

fn edge(&self, id: EdgeId) -> EdgeRef<'_, E>

Returns an edge instance, identified by the given id.

fn edge_start(&self, id: EdgeId) -> NodeId

Returns the start node of the edge identified by the given id.

fn edge_end(&self, id: EdgeId) -> NodeId

Returns the end node of the edge identified by the given id.

fn is_node_id_valid(&self, id: NodeId) -> bool

Returns true if the given NodeId refers to a node in this graph.

fn is_edge_id_valid(&self, id: EdgeId) -> bool

Returns true if the given EdgeId refers to an edge in this graph.

impl<N, E> MutableGraph<N, E> for SimpleGraph<N, E>

fn new() -> Self

Creates a new empty graph.

fn add_node(&mut self, node: Node<N>) -> NodeId

Adds the given node to the graph. The return value is the id assigned to the new node.

fn add_edge(&mut self, edge: Edge<E>) -> Result<EdgeId, GraphModificationError>

Adds the given edge to the graph. The return value is the id assigned to the new edge, or an error, if the edge refers a non-existing node.