Struct CompleteGraph 

pub struct CompleteGraph {
    pub vertex_num: VertexNum,
    pub vertices: Vec<CompleteGraphVertex>,
    pub edge_modifier: EdgeWeightModifier,
    pub weighted_edges: Vec<(VertexIndex, VertexIndex, Weight)>,
    /* private fields */
}

build complete graph out of skeleton graph using Dijkstra’s algorithm

Fields

vertex_num: VertexNum

number of vertices

vertices: Vec<CompleteGraphVertex>

the vertices to run Dijkstra’s algorithm

edge_modifier: EdgeWeightModifier

remember the edges that’s modified by erasures

weighted_edges: Vec<(VertexIndex, VertexIndex, Weight)>

original edge weights

Implementations

impl CompleteGraph

pub fn new( vertex_num: VertexNum, weighted_edges: &[(VertexIndex, VertexIndex, Weight)], ) -> Self

create complete graph given skeleton graph

pub fn reset(&mut self)

reset any temporary changes like erasure edges

pub fn load_erasures(&mut self, erasures: &[EdgeIndex])

temporarily set some edges to 0 weight, and when it resets, those edges will be reverted back to the original weight

pub fn load_dynamic_weights(&mut self, dynamic_weights: &[(EdgeIndex, Weight)])

pub fn invalidate_previous_dijkstra(&mut self) -> usize

invalidate Dijkstra’s algorithm state from previous call

pub fn all_edges_with_terminate( &mut self, vertex: VertexIndex, terminate: VertexIndex, ) -> BTreeMap<VertexIndex, (VertexIndex, Weight)>

get all complete graph edges from the specific vertex, but will terminate if terminate vertex is found

pub fn all_edges( &mut self, vertex: VertexIndex, ) -> BTreeMap<VertexIndex, (VertexIndex, Weight)>

get all complete graph edges from the specific vertex

pub fn get_path( &mut self, a: VertexIndex, b: VertexIndex, ) -> (Vec<(VertexIndex, Weight)>, Weight)

get minimum-weight path between any two vertices a and b, in the order a -> path[0].0 -> path[1].0 -> .... -> path[-1].0 and it’s guaranteed that path[-1].0 = b

Trait Implementations

impl Clone for CompleteGraph

fn clone(&self) -> CompleteGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CompleteGraph

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

Formats the value using the given formatter.