pub struct Frozen<'a, G: 'a>(/* private fields */);
Expand description
Frozen
is a graph wrapper.
The Frozen
only allows shared access (read-only) to the
underlying graph G
, but it allows mutable access to its
node and edge weights.
This is used to ensure immutability of the graph’s structure while permitting weights to be both read and written.
See indexing implementations and the traits Data
and DataMap
for read-write access to the graph’s weights.
Implementations§
source§impl<'a, N, E, Ty, Ix> Frozen<'a, Graph<N, E, Ty, Ix>>
impl<'a, N, E, Ty, Ix> Frozen<'a, Graph<N, E, Ty, Ix>>
sourcepub fn index_twice_mut<T, U>(
&mut self,
i: T,
j: U,
) -> (&mut <Graph<N, E, Ty, Ix> as Index<T>>::Output, &mut <Graph<N, E, Ty, Ix> as Index<U>>::Output)
pub fn index_twice_mut<T, U>( &mut self, i: T, j: U, ) -> (&mut <Graph<N, E, Ty, Ix> as Index<T>>::Output, &mut <Graph<N, E, Ty, Ix> as Index<U>>::Output)
Index the Graph
by two indices, any combination of
node or edge indices is fine.
Panics if the indices are equal or if they are out of bounds.
Trait Implementations§
source§impl<'a, G> Data for Frozen<'a, G>where
G: Data,
impl<'a, G> Data for Frozen<'a, G>where
G: Data,
type NodeWeight = <G as Data>::NodeWeight
type EdgeWeight = <G as Data>::EdgeWeight
source§impl<'a, G> DataMap for Frozen<'a, G>where
G: DataMap,
impl<'a, G> DataMap for Frozen<'a, G>where
G: DataMap,
fn node_weight(&self, id: Self::NodeId) -> Option<&Self::NodeWeight>
fn edge_weight(&self, id: Self::EdgeId) -> Option<&Self::EdgeWeight>
source§impl<'a, G> DataMapMut for Frozen<'a, G>where
G: DataMapMut,
impl<'a, G> DataMapMut for Frozen<'a, G>where
G: DataMapMut,
fn node_weight_mut(&mut self, id: Self::NodeId) -> Option<&mut Self::NodeWeight>
fn edge_weight_mut(&mut self, id: Self::EdgeId) -> Option<&mut Self::EdgeWeight>
source§impl<'a, G> Deref for Frozen<'a, G>
impl<'a, G> Deref for Frozen<'a, G>
Deref allows transparent access to all shared reference (read-only) functionality in the underlying graph.
source§impl<'a, G> EdgeCount for Frozen<'a, G>where
G: EdgeCount,
impl<'a, G> EdgeCount for Frozen<'a, G>where
G: EdgeCount,
source§fn edge_count(&self) -> usize
fn edge_count(&self) -> usize
Return the number of edges in the graph.
source§impl<'a, G> EdgeIndexable for Frozen<'a, G>where
G: EdgeIndexable,
impl<'a, G> EdgeIndexable for Frozen<'a, G>where
G: EdgeIndexable,
source§fn edge_bound(&self) -> usize
fn edge_bound(&self) -> usize
Return an upper bound of the edge indices in the graph
(suitable for the size of a bitmap).
source§fn from_index(&self, i: usize) -> Self::EdgeId
fn from_index(&self, i: usize) -> Self::EdgeId
Convert
i
to an edge index. i
must be a valid value in the graph.source§impl<'a, G> GetAdjacencyMatrix for Frozen<'a, G>where
G: GetAdjacencyMatrix,
impl<'a, G> GetAdjacencyMatrix for Frozen<'a, G>where
G: GetAdjacencyMatrix,
§type AdjMatrix = <G as GetAdjacencyMatrix>::AdjMatrix
type AdjMatrix = <G as GetAdjacencyMatrix>::AdjMatrix
The associated adjacency matrix type
source§fn adjacency_matrix(&self) -> Self::AdjMatrix
fn adjacency_matrix(&self) -> Self::AdjMatrix
Create the adjacency matrix
source§impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G>where
G: IntoEdgeReferences,
impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G>where
G: IntoEdgeReferences,
type EdgeRef = <G as IntoEdgeReferences>::EdgeRef
type EdgeReferences = <G as IntoEdgeReferences>::EdgeReferences
fn edge_references(self) -> Self::EdgeReferences
source§impl<'a, 'b, G> IntoEdgesDirected for &'b Frozen<'a, G>where
G: IntoEdgesDirected,
impl<'a, 'b, G> IntoEdgesDirected for &'b Frozen<'a, G>where
G: IntoEdgesDirected,
type EdgesDirected = <G as IntoEdgesDirected>::EdgesDirected
fn edges_directed(self, a: Self::NodeId, dir: Direction) -> Self::EdgesDirected
source§impl<'a, 'b, G> IntoNeighbors for &'b Frozen<'a, G>where
G: IntoNeighbors,
impl<'a, 'b, G> IntoNeighbors for &'b Frozen<'a, G>where
G: IntoNeighbors,
source§impl<'a, 'b, G> IntoNeighborsDirected for &'b Frozen<'a, G>where
G: IntoNeighborsDirected,
impl<'a, 'b, G> IntoNeighborsDirected for &'b Frozen<'a, G>where
G: IntoNeighborsDirected,
type NeighborsDirected = <G as IntoNeighborsDirected>::NeighborsDirected
fn neighbors_directed( self, n: Self::NodeId, d: Direction, ) -> Self::NeighborsDirected
source§impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G>where
G: IntoNodeIdentifiers,
impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G>where
G: IntoNodeIdentifiers,
type NodeIdentifiers = <G as IntoNodeIdentifiers>::NodeIdentifiers
fn node_identifiers(self) -> Self::NodeIdentifiers
source§impl<'a, 'b, G> IntoNodeReferences for &'b Frozen<'a, G>where
G: IntoNodeReferences,
impl<'a, 'b, G> IntoNodeReferences for &'b Frozen<'a, G>where
G: IntoNodeReferences,
type NodeRef = <G as IntoNodeReferences>::NodeRef
type NodeReferences = <G as IntoNodeReferences>::NodeReferences
fn node_references(self) -> Self::NodeReferences
source§impl<'a, G> NodeCount for Frozen<'a, G>where
G: NodeCount,
impl<'a, G> NodeCount for Frozen<'a, G>where
G: NodeCount,
fn node_count(&self) -> usize
source§impl<'a, G> NodeIndexable for Frozen<'a, G>where
G: NodeIndexable,
impl<'a, G> NodeIndexable for Frozen<'a, G>where
G: NodeIndexable,
source§fn node_bound(&self) -> usize
fn node_bound(&self) -> usize
Return an upper bound of the node indices in the graph
(suitable for the size of a bitmap).
source§fn from_index(&self, i: usize) -> Self::NodeId
fn from_index(&self, i: usize) -> Self::NodeId
Convert
i
to a node index. i
must be a valid value in the graph.impl<'a, G> NodeCompactIndexable for Frozen<'a, G>where
G: NodeCompactIndexable,
Auto Trait Implementations§
impl<'a, G> Freeze for Frozen<'a, G>
impl<'a, G> RefUnwindSafe for Frozen<'a, G>where
G: RefUnwindSafe,
impl<'a, G> Send for Frozen<'a, G>where
G: Send,
impl<'a, G> Sync for Frozen<'a, G>where
G: Sync,
impl<'a, G> Unpin for Frozen<'a, G>
impl<'a, G> !UnwindSafe for Frozen<'a, G>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more