[−][src]Trait bigraph::ImmutableGraphContainer

pub trait ImmutableGraphContainer: GraphBase {
    fn node_indices(
        &self
    ) -> GraphIndices<Self::NodeIndex, Self::OptionalNodeIndex>ⓘ
Important traits for GraphIndices<IndexType, OptionalIndexType>
impl<OptionalIndexType, IndexType> Iterator for GraphIndices<IndexType, OptionalIndexType> where
    IndexType: GraphIndex<OptionalIndexType>,
    OptionalIndexType: OptionalGraphIndex<IndexType>,     type Item = IndexType;
;

    fn edge_indices(
        &self
    ) -> GraphIndices<Self::EdgeIndex, Self::OptionalEdgeIndex>ⓘ
Important traits for GraphIndices<IndexType, OptionalIndexType>
impl<OptionalIndexType, IndexType> Iterator for GraphIndices<IndexType, OptionalIndexType> where
    IndexType: GraphIndex<OptionalIndexType>,
    OptionalIndexType: OptionalGraphIndex<IndexType>,     type Item = IndexType;
;

    fn contains_node_index(&self, node_id: Self::NodeIndex) -> bool;

    fn contains_edge_index(&self, edge_id: Self::EdgeIndex) -> bool;

    fn node_count(&self) -> usize;

    fn edge_count(&self) -> usize;

    fn node_data(&self, node_id: Self::NodeIndex) -> &Self::NodeData;

    fn edge_data(&self, edge_id: Self::EdgeIndex) -> &Self::EdgeData;

    fn node_data_mut(&mut self, node_id: Self::NodeIndex) -> &mut Self::NodeData;

    fn edge_data_mut(&mut self, edge_id: Self::EdgeIndex) -> &mut Self::EdgeData;

    fn contains_edge(&self, from: Self::NodeIndex, to: Self::NodeIndex) -> bool;

    fn is_empty(&self) -> bool { ... }
}

Required methods

fn node_indices(&self) -> GraphIndices<Self::NodeIndex, Self::OptionalNodeIndex>ⓘ

Important traits for GraphIndices<IndexType, OptionalIndexType>

impl<OptionalIndexType, IndexType> Iterator for GraphIndices<IndexType, OptionalIndexType> where
    IndexType: GraphIndex<OptionalIndexType>,
    OptionalIndexType: OptionalGraphIndex<IndexType>,  type Item = IndexType;

fn edge_indices(&self) -> GraphIndices<Self::EdgeIndex, Self::OptionalEdgeIndex>ⓘ

Important traits for GraphIndices<IndexType, OptionalIndexType>

impl<OptionalIndexType, IndexType> Iterator for GraphIndices<IndexType, OptionalIndexType> where
    IndexType: GraphIndex<OptionalIndexType>,
    OptionalIndexType: OptionalGraphIndex<IndexType>,  type Item = IndexType;

fn contains_node_index(&self, node_id: Self::NodeIndex) -> bool

fn contains_edge_index(&self, edge_id: Self::EdgeIndex) -> bool

fn node_count(&self) -> usize

fn edge_count(&self) -> usize

fn node_data(&self, node_id: Self::NodeIndex) -> &Self::NodeData

Returns the node data associated with the given node id, or None if there is no such node.

fn edge_data(&self, edge_id: Self::EdgeIndex) -> &Self::EdgeData

Returns the edge data associated with the given edge id, or None if there is no such edge.

fn node_data_mut(&mut self, node_id: Self::NodeIndex) -> &mut Self::NodeData

fn edge_data_mut(&mut self, edge_id: Self::EdgeIndex) -> &mut Self::EdgeData

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

Loading content...

Provided methods

fn is_empty(&self) -> bool

Returns true if the graph is empty, i.e. contains no nodes or edges.

Loading content...

Implementors

impl<NodeData, EdgeData> ImmutableGraphContainer for Graph<NodeData, EdgeData, Directed, usize>[src]

impl<Topology: ImmutableGraphContainer> ImmutableGraphContainer for NodeBigraphWrapper<Topology>[src]

Loading content...