Trait petgraph::visit::GetAdjacencyMatrix

pub trait GetAdjacencyMatrix: GraphBase {
    type AdjMatrix;
    fn adjacency_matrix(&self) -> Self::AdjMatrix;
    fn is_adjacent(
        &self, 
        matrix: &Self::AdjMatrix, 
        a: Self::NodeId, 
        b: Self::NodeId
    ) -> bool;
}

Create or access the adjacency matrix of a graph.

The implementor can either create an adjacency matrix, or it can return a placeholder if it has the needed representation internally.

Associated Types

type AdjMatrix

The associated adjacency matrix type

Required methods

fn adjacency_matrix(&self) -> Self::AdjMatrix

Create the adjacency matrix

fn is_adjacent(
    &self,
    matrix: &Self::AdjMatrix,
    a: Self::NodeId,
    b: Self::NodeId
) -> bool

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

Computes in O(1) time.

Implementations on Foreign Types

impl<'a, G> GetAdjacencyMatrix for &'a G where
    G: GetAdjacencyMatrix, 

type AdjMatrix = G::AdjMatrix

fn adjacency_matrix(&self) -> Self::AdjMatrix

fn is_adjacent(
    &self,
    matrix: &Self::AdjMatrix,
    a: Self::NodeId,
    b: Self::NodeId
) -> bool

Implementors

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

type AdjMatrix = G::AdjMatrix

impl<'a, N, E, Ty, Ix> GetAdjacencyMatrix for &'a Csr<N, E, Ty, Ix> where
    Ix: IndexType,
    Ty: EdgeType, 

The adjacency matrix for Csr is a bitmap that’s computed by .adjacency_matrix().

type AdjMatrix = FixedBitSet

impl<E, Ix> GetAdjacencyMatrix for List<E, Ix> where
    Ix: IndexType, 

The adjacency matrix for List is a bitmap that’s computed by .adjacency_matrix().

type AdjMatrix = FixedBitSet

impl<G> GetAdjacencyMatrix for Reversed<G> where
    G: GetAdjacencyMatrix, 

type AdjMatrix = G::AdjMatrix

impl<N, E, Ty, Ix> GetAdjacencyMatrix for Graph<N, E, Ty, Ix> where
    Ty: EdgeType,
    Ix: IndexType, 

The adjacency matrix for Graph is a bitmap that’s computed by .adjacency_matrix().

type AdjMatrix = FixedBitSet