Module matrix_graph 

MatrixGraph<N, E, Ty, NullN, NullE, Ix> is a graph datastructure backed by an adjacency matrix.

Re-exports

pub use crate::graph::IndexType;

Modules

private 🔒

Macros

not_zero_impl 🔒

not_zero_impls 🔒

Structs

EdgeReferences

Iterator over all edges of a graph.

Edges

Iterator over the edges of from or to a node

IdIterator 🔒

IdStorage 🔒

MatrixGraph

MatrixGraph<N, E, Ty, Null> is a graph datastructure using an adjacency matrix representation.

Neighbors

Iterator over the neighbors of a node.

NodeIdentifiers

Iterator over the node identifiers of a graph.

NodeReferences

Iterator over all nodes of a graph.

NotZero

NotZero is used to optimize the memory usage of edge weights E in a MatrixGraph, replacing the default Option<E> sentinel.

Enums

MatrixError

The error type for fallible MatrixGraph operations.

NeighborIterDirection 🔒

Traits

Nullable

Wrapper trait for an Option, allowing user-defined structs to be input as containers when defining a null element.

Zero

Base trait for types that can be wrapped in a NotZero.

Functions

ensure_len 🔒

Grow a Vec by appending the type’s default value until the size is reached.

extend_flat_square_matrix 🔒

extend_linearized_matrix 🔒

extend_lower_triangular_matrix 🔒

node_index

Short version of NodeIndex::new (with Ix = DefaultIx)

to_flat_square_matrix_position 🔒

to_linearized_matrix_position 🔒

to_lower_triangular_matrix_position 🔒

Type Aliases

DefaultIx 🔒

DiMatrix

A MatrixGraph with directed edges.

NodeIndex

Node identifier.

UnMatrix

A MatrixGraph with undirected edges.