Struct MapGraph 

pub struct MapGraph<NodeKey: Hash + Eq + Clone, NodeData: Clone, EdgeKey: Hash + Eq + Clone, EdgeData: Clone> { /* private fields */ }

A directed graph that also maintains an arbitrary key-node and key-edge mapping

See module docs for more information

Implementations

impl<NodeKey: Hash + Eq + Clone, NodeData: Clone, EdgeKey: Hash + Eq + Clone, EdgeData: Clone> MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

pub fn new() -> Self

Create a new, empty, graph

pub fn insert_node( &mut self, key: NodeKey, data: NodeData, ) -> Result<NodeMut<'_, NodeKey, NodeData, EdgeKey, EdgeData>, KeyAlreadyExists<NodeKey>>

Insert a node with the specified key and data

Returns a mutable reference to the new node

pub fn get_node( &self, key: &NodeKey, ) -> Option<NodeRef<'_, NodeKey, NodeData, EdgeKey, EdgeData>>

Get a reference to the node with the specified key.

Returns None if there is no such node

pub fn get_node_mut( &mut self, key: &NodeKey, ) -> Option<NodeMut<'_, NodeKey, NodeData, EdgeKey, EdgeData>>

Get a mutable reference to a node with the specified key

Returns None if there is no such node

pub fn iter_nodes(&self) -> GraphNodes<'_, NodeKey, NodeData, EdgeKey, EdgeData>

Iterate over all nodes in the graph

Order is unspecified

pub fn insert_edge( &mut self, from: NodeKey, to: NodeKey, key: EdgeKey, data: EdgeData, ) -> Result<EdgeMut<'_, NodeKey, NodeData, EdgeKey, EdgeData>, InsertEdgeError<NodeKey, EdgeKey>>

Insert a new edge between the specified nodes, with the specified key and data

pub fn get_edge( &self, key: &EdgeKey, ) -> Option<EdgeRef<'_, NodeKey, NodeData, EdgeKey, EdgeData>>

Get a reference to the edge with the specified key

Returns None if there is no such edge

pub fn get_edge_mut( &mut self, key: &EdgeKey, ) -> Option<EdgeMut<'_, NodeKey, NodeData, EdgeKey, EdgeData>>

Get a mutable reference to the edge with the specified key

Returns None if there is no such edge

pub fn iter_edges(&self) -> GraphEdges<'_, NodeKey, NodeData, EdgeKey, EdgeData>

Iterate over all edges in the graph

Order is unspecified

Trait Implementations

impl<NodeKey: Clone + Hash + Eq + Clone, NodeData: Clone + Clone, EdgeKey: Clone + Hash + Eq + Clone, EdgeData: Clone + Clone> Clone for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

fn clone(&self) -> MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<NodeKey: Debug + Hash + Eq + Clone, NodeData: Debug + Clone, EdgeKey: Debug + Hash + Eq + Clone, EdgeData: Debug + Clone> Debug for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

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

Formats the value using the given formatter.

impl<NodeKey: Hash + Eq + Clone, NodeData: Clone, EdgeKey: Hash + Eq + Clone, EdgeData: Clone> Default for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

fn default() -> Self

The default: an empty graph

impl<NodeKey: Hash + Hash + Eq + Clone, NodeData: Hash + Clone, EdgeKey: Hash + Hash + Eq + Clone, EdgeData: Hash + Clone> Hash for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<NodeKey: PartialEq + Hash + Eq + Clone, NodeData: PartialEq + Clone, EdgeKey: PartialEq + Hash + Eq + Clone, EdgeData: PartialEq + Clone> PartialEq for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

fn eq(&self, other: &MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>) -> 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<NodeKey: Eq + Hash + Eq + Clone, NodeData: Eq + Clone, EdgeKey: Eq + Hash + Eq + Clone, EdgeData: Eq + Clone> Eq for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>

impl<NodeKey: Hash + Eq + Clone, NodeData: Clone, EdgeKey: Hash + Eq + Clone, EdgeData: Clone> StructuralPartialEq for MapGraph<NodeKey, NodeData, EdgeKey, EdgeData>