[−][src]Trait bigraph::ImmutableGraphContainer
Required methods
fn node_indices(&self) -> NodeIndices<IndexType>ⓘImportant traits for NodeIndices<IndexType>
impl<IndexType> Iterator for NodeIndices<IndexType> where
IndexType: PrimInt, type Item = NodeIndex<IndexType>;
Important traits for NodeIndices<IndexType>
impl<IndexType> Iterator for NodeIndices<IndexType> where
IndexType: PrimInt, type Item = NodeIndex<IndexType>;
fn edge_indices(&self) -> EdgeIndices<IndexType>ⓘImportant traits for EdgeIndices<IndexType>
impl<IndexType> Iterator for EdgeIndices<IndexType> where
IndexType: PrimInt, type Item = EdgeIndex<IndexType>;
Important traits for EdgeIndices<IndexType>
impl<IndexType> Iterator for EdgeIndices<IndexType> where
IndexType: PrimInt, 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>
&mut self,
node_id: NodeIndex<IndexType>
) -> Option<&mut NodeData>
fn edge_data_mut(
&mut self,
edge_id: EdgeIndex<IndexType>
) -> Option<&mut EdgeData>
&mut self,
edge_id: EdgeIndex<IndexType>
) -> Option<&mut EdgeData>
fn contains_edge(
&self,
from: NodeIndex<IndexType>,
to: NodeIndex<IndexType>
) -> bool
&self,
from: NodeIndex<IndexType>,
to: NodeIndex<IndexType>
) -> bool
Implementors
impl<NodeData, EdgeData> ImmutableGraphContainer<NodeData, EdgeData, usize> for Graph<NodeData, EdgeData, Directed, usize>
[src]
fn node_indices(&self) -> NodeIndices<usize>ⓘImportant traits for NodeIndices<IndexType>
impl<IndexType> Iterator for NodeIndices<IndexType> where
IndexType: PrimInt, type Item = NodeIndex<IndexType>;
[src]
Important traits for NodeIndices<IndexType>
impl<IndexType> Iterator for NodeIndices<IndexType> where
IndexType: PrimInt, type Item = NodeIndex<IndexType>;
fn edge_indices(&self) -> EdgeIndices<usize>ⓘImportant traits for EdgeIndices<IndexType>
impl<IndexType> Iterator for EdgeIndices<IndexType> where
IndexType: PrimInt, type Item = EdgeIndex<IndexType>;
[src]
Important traits for EdgeIndices<IndexType>
impl<IndexType> Iterator for EdgeIndices<IndexType> where
IndexType: PrimInt, type Item = EdgeIndex<IndexType>;
fn node_count(&self) -> usize
[src]
fn edge_count(&self) -> usize
[src]
fn node_data(&self, node_id: NodeIndex<usize>) -> Option<&NodeData>
[src]
fn edge_data(&self, edge_id: EdgeIndex<usize>) -> Option<&EdgeData>
[src]
fn node_data_mut(&mut self, node_id: NodeIndex<usize>) -> Option<&mut NodeData>
[src]
fn edge_data_mut(&mut self, edge_id: EdgeIndex<usize>) -> Option<&mut EdgeData>
[src]
fn contains_edge(&self, from: NodeIndex<usize>, to: NodeIndex<usize>) -> bool
[src]
impl<NodeData, EdgeData, IndexType: PrimInt, T: ImmutableGraphContainer<NodeData, EdgeData, IndexType>> ImmutableGraphContainer<NodeData, EdgeData, IndexType> for NodeBigraphWrapper<NodeData, EdgeData, IndexType, T>
[src]
fn node_indices(&self) -> NodeIndices<IndexType>ⓘImportant traits for NodeIndices<IndexType>
impl<IndexType> Iterator for NodeIndices<IndexType> where
IndexType: PrimInt, type Item = NodeIndex<IndexType>;
[src]
Important traits for NodeIndices<IndexType>
impl<IndexType> Iterator for NodeIndices<IndexType> where
IndexType: PrimInt, type Item = NodeIndex<IndexType>;
fn edge_indices(&self) -> EdgeIndices<IndexType>ⓘImportant traits for EdgeIndices<IndexType>
impl<IndexType> Iterator for EdgeIndices<IndexType> where
IndexType: PrimInt, type Item = EdgeIndex<IndexType>;
[src]
Important traits for EdgeIndices<IndexType>
impl<IndexType> Iterator for EdgeIndices<IndexType> where
IndexType: PrimInt, type Item = EdgeIndex<IndexType>;
fn node_count(&self) -> usize
[src]
fn edge_count(&self) -> usize
[src]
fn node_data(&self, node_id: NodeIndex<IndexType>) -> Option<&NodeData>
[src]
fn edge_data(&self, edge_id: EdgeIndex<IndexType>) -> Option<&EdgeData>
[src]
fn node_data_mut(
&mut self,
node_id: NodeIndex<IndexType>
) -> Option<&mut NodeData>
[src]
&mut self,
node_id: NodeIndex<IndexType>
) -> Option<&mut NodeData>
fn edge_data_mut(
&mut self,
edge_id: EdgeIndex<IndexType>
) -> Option<&mut EdgeData>
[src]
&mut self,
edge_id: EdgeIndex<IndexType>
) -> Option<&mut EdgeData>
fn contains_edge(
&self,
from: NodeIndex<IndexType>,
to: NodeIndex<IndexType>
) -> bool
[src]
&self,
from: NodeIndex<IndexType>,
to: NodeIndex<IndexType>
) -> bool