Struct fast_paths::InputGraph

pub struct InputGraph { /* fields omitted */ }

Methods

impl InputGraph

pub fn new() -> Self

pub fn random(rng: &mut StdRng, num_nodes: usize, mean_degree: f32) -> Self

pub fn from_file(filename: &str) -> Self

pub fn add_edge(&mut self, from: NodeId, to: NodeId, weight: Weight) -> usize

pub fn add_edge_bidir(
    &mut self,
    from: NodeId,
    to: NodeId,
    weight: Weight
) -> usize

pub fn get_edges(&self) -> &Vec<Edge>

pub fn get_num_nodes(&self) -> usize

pub fn get_num_edges(&self) -> usize

pub fn freeze(&mut self)

pub fn thaw(&mut self)

pub fn unit_test_output_string(&self) -> String

Trait Implementations

impl Debug for InputGraph

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

Formats the value using the given formatter.

impl Serialize for InputGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<'de> Deserialize<'de> for InputGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.