Struct petgraph::graph::Frozen [] [src]

pub struct Frozen<'a, G: 'a>(_);

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.

Methods

impl<'a, G> Frozen<'a, G>
[src]

[src]

Create a new Frozen from a mutable reference to a graph.

impl<'a, N, E, Ty, Ix> Frozen<'a, Graph<N, E, Ty, Ix>> where
    Ty: EdgeType,
    Ix: IndexType
[src]

[src]

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

impl<'a, G> GraphBase for Frozen<'a, G> where
    G: GraphBase
[src]

node identifier

edge identifier

impl<'a, G> Deref for Frozen<'a, G>
[src]

Deref allows transparent access to all shared reference (read-only) functionality in the underlying graph.

The resulting type after dereferencing.

[src]

Dereferences the value.

impl<'a, G, I> Index<I> for Frozen<'a, G> where
    G: Index<I>, 
[src]

The returned type after indexing.

[src]

Performs the indexing (container[index]) operation.

impl<'a, G, I> IndexMut<I> for Frozen<'a, G> where
    G: IndexMut<I>, 
[src]

[src]

Performs the mutable indexing (container[index]) operation.

impl<'a, G> Data for Frozen<'a, G> where
    G: Data
[src]

impl<'a, G> DataMap for Frozen<'a, G> where
    G: DataMap
[src]

[src]

[src]

impl<'a, G> DataMapMut for Frozen<'a, G> where
    G: DataMapMut
[src]

[src]

[src]

impl<'a, G> GetAdjacencyMatrix for Frozen<'a, G> where
    G: GetAdjacencyMatrix
[src]

The associated adjacency matrix type

[src]

Create the adjacency matrix

[src]

Return true if there is an edge from a to b, false otherwise. Read more

impl<'a, 'b, G> IntoEdgeReferences for &'b Frozen<'a, G> where
    G: IntoEdgeReferences
[src]

[src]

impl<'a, 'b, G> IntoEdges for &'b Frozen<'a, G> where
    G: IntoEdges
[src]

[src]

impl<'a, 'b, G> IntoEdgesDirected for &'b Frozen<'a, G> where
    G: IntoEdgesDirected
[src]

[src]

impl<'a, 'b, G> IntoNeighbors for &'b Frozen<'a, G> where
    G: IntoNeighbors
[src]

[src]

Return an iterator of the neighbors of node a.

impl<'a, 'b, G> IntoNeighborsDirected for &'b Frozen<'a, G> where
    G: IntoNeighborsDirected
[src]

[src]

impl<'a, 'b, G> IntoNodeIdentifiers for &'b Frozen<'a, G> where
    G: IntoNodeIdentifiers
[src]

[src]

impl<'a, 'b, G> IntoNodeReferences for &'b Frozen<'a, G> where
    G: IntoNodeReferences
[src]

[src]

impl<'a, G> NodeCompactIndexable for Frozen<'a, G> where
    G: NodeCompactIndexable
[src]

impl<'a, G> NodeCount for Frozen<'a, G> where
    G: NodeCount
[src]

[src]

impl<'a, G> NodeIndexable for Frozen<'a, G> where
    G: NodeIndexable
[src]

[src]

Return an upper bound of the node indices in the graph (suitable for the size of a bitmap). Read more

[src]

Convert a to an integer index.

[src]

Convert i to a node index

impl<'a, G> GraphProp for Frozen<'a, G> where
    G: GraphProp
[src]

The kind edges in the graph.

[src]

impl<'a, G> Visitable for Frozen<'a, G> where
    G: Visitable
[src]

The associated map type

[src]

Create a new visitor map

[src]

Reset the visitor map (and resize to new size of graph if needed)