g6 0.0.2

graph6 import
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

use std::fmt::{Debug, Formatter};
use std::str::FromStr;
use fixedbitset::FixedBitSet;
use crate::Graph6Error;
use crate::utils::{fill_bitset, get_size};

/// A directed graph represented by digraph6 format.
#[derive(Clone)]
pub struct DiGraph6 {
    nodes: usize,
    bitset: FixedBitSet,
}

impl Debug for DiGraph6 {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("digraph6")
            .field("nodes", &self.nodes())
            .field("edges", &self.edges())
            .field("adjacency", &self.bitset.to_string())
            .finish()
    }
}

impl FromStr for DiGraph6 {
    type Err = Graph6Error;

    fn from_str(s: &str) -> Result<Self, Graph6Error> {
        let bytes = remove_head(s.as_bytes())?;
        let (nodes, bytes) = get_size(bytes)?;
        let bitset = fill_bitset(bytes, nodes * nodes)?;
        Ok(DiGraph6 {
            nodes,
            bitset,
        })
    }
}

impl DiGraph6 {
    /// Get the number of nodes in the graph.
    pub fn nodes(&self) -> usize {
        self.nodes
    }
    /// Get the number of edges in the graph.
    pub fn edges(&self) -> usize {
        self.bitset.ones().count()
    }
}

/// 必须是 & 开头
fn remove_head(bytes: &[u8]) -> Result<&[u8], Graph6Error> {
    if bytes.starts_with(b">>digraph6<<&") {
        Ok(&bytes[13..])
    } else if bytes.starts_with(b"&") {
        Ok(&bytes[1..])
    } else {
        Err(Graph6Error::InvalidHeader { except: "&" })
    }
}