Struct algorithms_edu::algo::graph::WeightedAdjacencyMatrix

pub struct WeightedAdjacencyMatrix { /* fields omitted */ }

Dense graphs, are sometimes more efficient to be represented as adjacency matrices. A WeightedAdjacencyMatrix is based on a Matrix of size n * n where n is the number of nodes (vertices) in the graph. For a WeightedAdjacencyMatrix g, g[i][j] is the weight of the edge pointing from node i to node j. By convention, for two nodes i and j that are not connected, g[i][j] = INFINITY, and each node by default has a weight of 0 to point to itself (i.e. g[i][i] = 0).

Implementations

impl WeightedAdjacencyMatrix

pub fn with_size(n: usize) -> Self

pub fn node_count(&self) -> usize

Number of nodes in the graph.

pub fn from_adjacency_list(inp: &WeightedAdjacencyList) -> Self

Converts a WeightedAdjacencyList to WeightedAdjacencyMatrix

pub fn from_inner(matrix: Vec<Vec<f64>>) -> Self

Builds a WeightedAdjacencyMatrix from its underlying representation.

Trait Implementations

impl Display for WeightedAdjacencyMatrix

Pretty-prints a small graph represented by an adjacency matrix

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl From<Vec<Vec<f64, Global>, Global>> for WeightedAdjacencyMatrix

For convinience

pub fn from(matrix: Vec<Vec<f64>>) -> Self

Performs the conversion.

impl From<WeightedAdjacencyList> for WeightedAdjacencyMatrix

For convinience

pub fn from(inp: WeightedAdjacencyList) -> Self

Performs the conversion.

impl Index<usize> for WeightedAdjacencyMatrix

This allows us to access the weight of edge i -> j in graph g by g[i][j] rather than g.inner[i][j]

type Output = Vec<f64>

The returned type after indexing.

pub fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.