Struct traitgraph_algo::dijkstra::DijkstraPerformanceCounter

pub struct DijkstraPerformanceCounter {
    pub iterations: u64,
    pub unnecessary_heap_elements: u64,
}

A simple performance counter for Dijkstra’s algorithm, keeping all supported counts.

Fields

iterations: u64

The number of iterations of the main loop of Dijkstra’s algorithm.

unnecessary_heap_elements: u64

The number of unnecessary heap elements.

Trait Implementations

impl Debug for DijkstraPerformanceCounter

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

Formats the value using the given formatter.

impl Default for DijkstraPerformanceCounter

fn default() -> DijkstraPerformanceCounter

Returns the “default value” for a type.

impl DijkstraPerformanceData for DijkstraPerformanceCounter

fn add_iteration(&mut self)

Increment the number of iterations of the main loop of Dijkstra’s algorithm.

fn add_unnecessary_heap_element(&mut self)

Increment the number of heap elements that already have a lower weight than what was stored in the heap. These are wasted cycles because our heap does not support the decrease_key operation.

fn iterations(&self) -> Option<u64>

Get the number of iterations of the main loop of Dijkstra’s algorithm.

fn unnecessary_heap_elements(&self) -> Option<u64>

Get the number of unnecessary heap elements that were inserted during Dijkstra’s algorithm.