pub trait GetAdjacencyMatrix: GraphBase {
type AdjMatrix;
// Required methods
fn adjacency_matrix(&self) -> Self::AdjMatrix;
fn is_adjacent(
&self,
matrix: &Self::AdjMatrix,
a: Self::NodeId,
b: Self::NodeId,
) -> bool;
}
Expand description
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.
Required Associated Types§
Required Methods§
Sourcefn adjacency_matrix(&self) -> Self::AdjMatrix
fn adjacency_matrix(&self) -> Self::AdjMatrix
Create the adjacency matrix
Implementations on Foreign Types§
Source§impl<'a, G> GetAdjacencyMatrix for &'a Gwhere
G: GetAdjacencyMatrix,
impl<'a, G> GetAdjacencyMatrix for &'a Gwhere
G: GetAdjacencyMatrix,
Implementors§
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
Source§impl<'a, N, E, Ty, Ix> GetAdjacencyMatrix for &'a Csr<N, E, Ty, Ix>
impl<'a, N, E, Ty, Ix> GetAdjacencyMatrix for &'a Csr<N, E, Ty, Ix>
The adjacency matrix for Csr is a bitmap that’s computed by
.adjacency_matrix()
.
type AdjMatrix = FixedBitSet
Source§impl<E, Ix> GetAdjacencyMatrix for List<E, Ix>where
Ix: IndexType,
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
Source§impl<G> GetAdjacencyMatrix for Reversed<G>where
G: GetAdjacencyMatrix,
impl<G> GetAdjacencyMatrix for Reversed<G>where
G: GetAdjacencyMatrix,
type AdjMatrix = <G as GetAdjacencyMatrix>::AdjMatrix
Source§impl<N, E, Ty, Ix> GetAdjacencyMatrix for Graph<N, E, Ty, Ix>
impl<N, E, Ty, Ix> GetAdjacencyMatrix for Graph<N, E, Ty, Ix>
The adjacency matrix for Graph is a bitmap that’s computed by
.adjacency_matrix()
.
type AdjMatrix = FixedBitSet
Source§impl<N, E, Ty, Ix> GetAdjacencyMatrix for StableGraph<N, E, Ty, Ix>
impl<N, E, Ty, Ix> GetAdjacencyMatrix for StableGraph<N, E, Ty, Ix>
The adjacency matrix for Graph is a bitmap that’s computed by
.adjacency_matrix()
.
type AdjMatrix = FixedBitSet
Source§impl<N, E, Ty, S> GetAdjacencyMatrix for GraphMap<N, E, Ty, S>
impl<N, E, Ty, S> GetAdjacencyMatrix for GraphMap<N, E, Ty, S>
The GraphMap
keeps an adjacency matrix internally.