Trait GraphConversion 

pub trait GraphConversion {
    // Required methods
    fn bit_vec(&self) -> &[usize];
    fn size(&self) -> usize;
    fn is_directed(&self) -> bool;

    // Provided methods
    fn to_dot(&self, id: Option<usize>) -> String { ... }
    fn to_undirected_dot(&self, dot: &mut String, bit_vec: &[usize], n: usize) { ... }
    fn to_directed_dot(&self, dot: &mut String, bit_vec: &[usize], n: usize) { ... }
    fn to_adjmat(&self) -> String { ... }
    fn to_flat(&self) -> String { ... }
    fn to_net(&self) -> String { ... }
}

Conversion trait for graphs into various text graph formats

Required Methods

fn bit_vec(&self) -> &[usize]

Returns the bitvector representation of the graph

fn size(&self) -> usize

Returns the number of vertices in the graph

fn is_directed(&self) -> bool

Returns true if the graph is directed

Provided Methods

fn to_dot(&self, id: Option<usize>) -> String

Returns the graph in the DOT format

fn to_undirected_dot(&self, dot: &mut String, bit_vec: &[usize], n: usize)

fn to_directed_dot(&self, dot: &mut String, bit_vec: &[usize], n: usize)

fn to_adjmat(&self) -> String

Returns the graph as an adjacency matrix

fn to_flat(&self) -> String

Returns the graph in a flat adjacency matrix

fn to_net(&self) -> String

Returns the graph in the Pajek NET format

Implementors

impl GraphConversion for DiGraph

impl GraphConversion for Graph