Struct BidirectedAdjacencyArray 

pub struct BidirectedAdjacencyArray<IndexType: GraphIndexInteger, NodeData, EdgeData> { /* private fields */ }

Implementations

impl<IndexType: GraphIndexInteger, NodeData, EdgeData> BidirectedAdjacencyArray<IndexType, NodeData, EdgeData>

pub fn new( nodes: TaggedVec<NodeIndex<IndexType>, NodeData>, edges: TaggedVec<EdgeIndex<IndexType>, BidirectedEdge<IndexType, EdgeData>>, ) -> Self

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn iter_nodes(&self) -> impl Iterator<Item = NodeIndex<IndexType>>

pub fn iter_edges(&self) -> impl Iterator<Item = EdgeIndex<IndexType>>

pub fn iter_successors( &self, node: DirectedNodeIndex<IndexType>, ) -> impl Iterator<Item = (DirectedEdgeIndex<IndexType>, DirectedNodeIndex<IndexType>)>

pub fn node_data(&self, node: NodeIndex<IndexType>) -> &NodeData

pub fn edge( &self, edge: EdgeIndex<IndexType>, ) -> EdgeView<'_, IndexType, EdgeData>

pub fn directed_edge_data<'this>( &'this self, edge: DirectedEdgeIndex<IndexType>, ) -> DirectedEdgeDataView<'this, EdgeData>

impl<IndexType: GraphIndexInteger, NodeData, EdgeData> BidirectedAdjacencyArray<IndexType, NodeData, EdgeData>

pub fn compare( &self, other: &Self, ) -> Result<(), GraphComparisonError<IndexType>>

where NodeData: Eq, EdgeData: Eq,

Compares this graph to another graph.

The comparison returns Ok if all nodes and edges are identical in both graphs. Otherwise, it returns an Err describing the differences.

Trait Implementations

impl<IndexType: Debug + GraphIndexInteger, NodeData: Debug, EdgeData: Debug> Debug for BidirectedAdjacencyArray<IndexType, NodeData, EdgeData>

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

Formats the value using the given formatter.