Trait traitgraph::ImmutableGraphContainer

pub trait ImmutableGraphContainer<NodeData, EdgeData, IndexType: PrimInt> {
    fn node_indices(&self) -> NodeIndices<IndexType>ⓘ
Important traits for NodeIndices<IndexType>
impl<IndexType: PrimInt> Iterator for NodeIndices<IndexType>    type Item = NodeIndex<IndexType>;;
    fn edge_indices(&self) -> EdgeIndices<IndexType>ⓘ
Important traits for EdgeIndices<IndexType>
impl<IndexType: PrimInt> Iterator for EdgeIndices<IndexType>    type Item = EdgeIndex<IndexType>;;
    fn node_count(&self) -> usize;
    fn edge_count(&self) -> usize;
    fn node_data(&self, node_id: NodeIndex<IndexType>) -> Option<&NodeData>;
    fn edge_data(&self, edge_id: EdgeIndex<IndexType>) -> Option<&EdgeData>;
    fn node_data_mut(
        &mut self, 
        node_id: NodeIndex<IndexType>
    ) -> Option<&mut NodeData>;
    fn edge_data_mut(
        &mut self, 
        edge_id: EdgeIndex<IndexType>
    ) -> Option<&mut EdgeData>;
    fn contains_edge(
        &self, 
        from: NodeIndex<IndexType>, 
        to: NodeIndex<IndexType>
    ) -> bool;
}

Required methods

fn node_indices(&self) -> NodeIndices<IndexType>ⓘ

Important traits for NodeIndices<IndexType>

impl<IndexType: PrimInt> Iterator for NodeIndices<IndexType> type Item = NodeIndex<IndexType>;

fn edge_indices(&self) -> EdgeIndices<IndexType>ⓘ

Important traits for EdgeIndices<IndexType>

impl<IndexType: PrimInt> Iterator for EdgeIndices<IndexType> type Item = EdgeIndex<IndexType>;

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn node_data(&self, node_id: NodeIndex<IndexType>) -> Option<&NodeData>

fn edge_data(&self, edge_id: EdgeIndex<IndexType>) -> Option<&EdgeData>

fn node_data_mut(
    &mut self,
    node_id: NodeIndex<IndexType>
) -> Option<&mut NodeData>

fn edge_data_mut(
    &mut self,
    edge_id: EdgeIndex<IndexType>
) -> Option<&mut EdgeData>

fn contains_edge(
    &self,
    from: NodeIndex<IndexType>,
    to: NodeIndex<IndexType>
) -> bool

Loading content...

Implementations on Foreign Types

impl<NodeData, EdgeData> ImmutableGraphContainer<NodeData, EdgeData, usize> for Graph<NodeData, EdgeData, Directed, usize>

fn node_indices(&self) -> NodeIndices<usize>ⓘ

Important traits for NodeIndices<IndexType>

impl<IndexType: PrimInt> Iterator for NodeIndices<IndexType> type Item = NodeIndex<IndexType>;

fn edge_indices(&self) -> EdgeIndices<usize>ⓘ

Important traits for EdgeIndices<IndexType>

impl<IndexType: PrimInt> Iterator for EdgeIndices<IndexType> type Item = EdgeIndex<IndexType>;

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn node_data(&self, node_id: NodeIndex<usize>) -> Option<&NodeData>

fn edge_data(&self, edge_id: EdgeIndex<usize>) -> Option<&EdgeData>

fn node_data_mut(&mut self, node_id: NodeIndex<usize>) -> Option<&mut NodeData>

fn edge_data_mut(&mut self, edge_id: EdgeIndex<usize>) -> Option<&mut EdgeData>

fn contains_edge(&self, from: NodeIndex<usize>, to: NodeIndex<usize>) -> bool

Loading content...

Implementors

Loading content...