Struct MapAdjacencyList 

pub struct MapAdjacencyList<NI, E, M>
where
    NI: NodeIndex,
    E: NodesIterable<Node = NI>,
    M: MapTrait<NI, E>,
{ /* private fields */ }

Implementations

impl<NI, E, M> MapAdjacencyList<NI, E, M>

where NI: NodeIndex, E: NodesIterable<Node = NI>, M: MapTrait<NI, E>,

pub fn new(nodes: M) -> Result<Self, GraphError<NI>>

where NI: Copy, Self: Graph<NI, Error = GraphError<NI>>,

Create new map adjacency list with validation

This function validates that all edge destinations exist in the node set. Returns an error if any edge references a non-existent node.

pub fn new_unchecked(nodes: M) -> Self

Trait Implementations

impl<NI, E, M> FromGraph<NI, GraphError<NI>> for MapAdjacencyList<NI, E, M>

where NI: NodeIndex, E: NodesIterable<Node = NI> + MutableNodes<NI> + Default, M: MapTrait<NI, E> + Default,

fn from_graph<G>(source_graph: &G) -> Result<Self, GraphError<NI>>

where G: Graph<NI>, GraphError<NI>: From<G::Error>,

Creates a new graph by copying data from the source graph

impl<NI, E, M> Graph<NI> for MapAdjacencyList<NI, E, M>

where M: MapTrait<NI, E>, NI: NodeIndex + Eq + Hash + Copy, E: NodesIterable<Node = NI>,

fn contains_node(&self, node: NI) -> Result<bool, Self::Error>

Optimized O(1) contains_node for map adjacency list

fn outgoing_edges( &self, node: NI, ) -> Result<impl Iterator<Item = NI>, Self::Error>

Optimized O(out-degree) outgoing_edges for map adjacency list

type Error = GraphError<NI>

fn iter_nodes(&self) -> Result<impl Iterator<Item = NI>, Self::Error>

Return an iterator over all nodes in the graph

fn iter_edges(&self) -> Result<impl Iterator<Item = (NI, NI)>, Self::Error>

Return an iterator over all edges in the graph

fn incoming_edges( &self, node: NI, ) -> Result<impl Iterator<Item = NI>, Self::Error>

Return an iterator over all incoming edges for a node

impl<NI, E, M> GraphWithMutableEdges<NI> for MapAdjacencyList<NI, E, M>

where NI: NodeIndex + Eq + Hash + Copy + PartialEq, E: NodesIterable<Node = NI> + MutableNodes<NI>, M: MapTrait<NI, E>,

fn add_edge(&mut self, source: NI, destination: NI) -> Result<(), Self::Error>

Add a new edge to the graph

fn remove_edge( &mut self, source: NI, destination: NI, ) -> Result<(), Self::Error>

Remove an edge from the graph

impl<NI, E, M> GraphWithMutableNodes<NI> for MapAdjacencyList<NI, E, M>

where NI: NodeIndex + Eq + Hash + Copy, E: NodesIterable<Node = NI> + Default, M: MapTrait<NI, E>,

fn add_node(&mut self, node: NI) -> Result<(), Self::Error>

Add a new node to the graph

fn remove_node(&mut self, node: NI) -> Result<(), Self::Error>

Remove a node from the graph