Trait GraphAlgorithm 

pub trait GraphAlgorithm {
    type Node;
    type Weight;

    // Required method
    fn run(&self, start: Option<Self::Node>) -> Result<Self::Weight, GraphError>;
}

A trait for graph search algorithms.

Required Associated Types

type Node

Type of node.

type Weight

Type of weight.

Required Methods

fn run(&self, start: Option<Self::Node>) -> Result<Self::Weight, GraphError>

Run the graph algorithm.

Arguments

• start: Starting node, if applicable.

Returns

Result containing the weight of the shortest path, or an error.

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl GraphAlgorithm for BellmanFordAlgorithm

type Node = isize

type Weight = Vec<i32>

impl GraphAlgorithm for DijkstraAlgorithm

type Node = usize

type Weight = Vec<usize>

impl GraphAlgorithm for FloydWarshallAlgorithm

type Node = usize

type Weight = Vec<Vec<i32>>