Struct matrixgraph::Digraph

pub struct Digraph { /* fields omitted */ }

A digraph represented by a dense adjacency matrix of fixed size

The cells of the adjacency matrix are assigned values of type Option where a None value represents the absence of an edge.

Methods

impl Digraph

fn new(size: usize) -> Digraph

Creates a new digraph object with a fixed size.

fn from_vec(weights: &Vec<Option<f64>>) -> Digraph

Creates a new digraph object with a fixed size from a vector that is the row-wise representation of an adjacency matrix.

fn to_vec(&self) -> Vec<Option<f64>>

Returns the vector that is the row-wise representation of the adjacency matrix of the digraph.

Trait Implementations

impl PartialEq for Digraph

fn eq(&self, __arg_0: &Digraph) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &Digraph) -> bool

This method tests for !=.

impl Clone for Digraph

fn clone(&self) -> Digraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Digraph

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

Formats the value using the given formatter.

impl BasicGraphMethods for Digraph

fn size(&self) -> usize

Returns the size of the graph, i.e. its number of vertices.

fn get_edge(&self, edge: (usize, usize)) -> Option<f64>

Returns the value of an edge of the graph.

fn set_edge(&mut self, edge: (usize, usize), value: Option<f64>)

Sets the value of an edge of the graph.