graph6-rs 0.2.1

A library for parsing graph6/digraph6 strings and converting them into other text based formats
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118

/// Conversion trait for graphs into various text graph formats
pub trait GraphConversion {
    /// Returns the bitvector representation of the graph
    fn bit_vec(&self) -> &[usize];

    /// Returns the number of vertices in the graph
    fn size(&self) -> usize;

    /// Returns true if the graph is directed
    fn is_directed(&self) -> bool;

    /// Returns the graph in the DOT format
    fn to_dot(&self, id: Option<usize>) -> String {
        let n = self.size();
        let bit_vec = self.bit_vec();

        let mut dot = String::new();

        // include graph type
        if self.is_directed() {
            dot.push_str("digraph ");
        } else {
            dot.push_str("graph ");
        }

        // include graph id
        if let Some(id) = id {
            dot.push_str(&format!("graph_{} {{", id));
        } else {
            dot.push('{');
        }

        // include edges
        if self.is_directed() {
            self.to_directed_dot(&mut dot, bit_vec, n);
        } else {
            self.to_undirected_dot(&mut dot, bit_vec, n);
        }

        // close graph
        dot.push_str("\n}");

        dot
    }

    fn to_undirected_dot(&self, dot: &mut String, bit_vec: &[usize], n: usize) {
        for i in 0..n {
            for j in i..n {
                if bit_vec[i * n + j] == 1 {
                    dot.push_str(&format!("\n{} -- {};", i, j));
                }
            }
        }
    }

    fn to_directed_dot(&self, dot: &mut String, bit_vec: &[usize], n: usize) {
        for i in 0..n {
            for j in 0..n {
                if bit_vec[i * n + j] == 1 {
                    dot.push_str(&format!("\n{} -> {};", i, j));
                }
            }
        }
    }

    /// Returns the graph as an adjacency matrix
    fn to_adjmat(&self) -> String {
        let n = self.size();
        let bit_vec = self.bit_vec();

        let mut adj = String::new();
        for i in 0..n {
            for j in 0..n {
                adj.push_str(&format!("{}", bit_vec[i * n + j]));
                if j < n - 1 {
                    adj.push(' ');
                }
            }
            adj.push('\n');
        }
        adj
    }

    /// Returns the graph in a flat adjacency matrix
    fn to_flat(&self) -> String {
        let n = self.size();
        let bit_vec = self.bit_vec();

        let mut flat = String::new();
        for i in 0..n {
            for j in 0..n {
                flat.push_str(&format!("{}", bit_vec[i * n + j]));
            }
        }
        flat
    }

    /// Returns the graph in the Pajek NET format
    fn to_net(&self) -> String {
        let n = self.size();
        let bit_vec = self.bit_vec();

        let mut net = String::new();
        net.push_str(&format!("*Vertices {}\n", n));
        for i in 0..n {
            net.push_str(&format!("{} \"{}\"\n", i + 1, i));
        }
        net.push_str("*Arcs\n");
        for i in 0..n {
            for j in 0..n {
                if bit_vec[i * n + j] == 1 {
                    net.push_str(&format!("{} {}\n", i + 1, j + 1));
                }
            }
        }
        net
    }
}