Struct Graph

pub struct Graph {
    pub bit_vec: Vec<usize>,
    pub n: usize,
}

Creates an undirected graph from a graph6 representation

Fields

bit_vec: Vec<usize>

n: usize

Implementations

impl Graph

pub fn from_g6(repr: &str) -> Result<Self, IOError>

Creates a new undirected graph from a graph6 representation

Arguments

• repr - A graph6 representation of the graph

Example

use graph6_rs::Graph;
let graph = Graph::from_g6("A_").unwrap();
assert_eq!(graph.n, 2);
assert_eq!(graph.bit_vec, &[0, 1, 1, 0]);

pub fn from_adj(adj: &[usize]) -> Result<Self, IOError>

Creates a new undirected graph from a flattened adjacency matrix. The adjacency matrix must be square. The adjacency matrix will be forced into a symmetric matrix.

Arguments

• adj - A flattened adjacency matrix

Errors

Returns an error if the adjacency matrix is invalid (i.e. not square)

Example

use graph6_rs::Graph;
let graph = Graph::from_adj(&[0, 0, 1, 0]).unwrap();
assert_eq!(graph.n, 2);
assert_eq!(graph.bit_vec, &[0, 1, 1, 0]);

Trait Implementations

impl Debug for Graph

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

Formats the value using the given formatter.

impl GraphConversion for Graph

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

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

impl WriteGraph for Graph

fn write_graph(&self) -> String