dot-parser 0.6.1

This library provides a parser for the DOT/Graphviz graph description language, as well as useful functions to transform those graphs.
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

// The goal of this example is to obtain the list of nodes and the list of edges of a graph, and to
// associate them with the "label" (if defined).
//
// For instance, if we are given the following graph:
//
// graph {
//  A[label="A"];
//  B;
//  C[label="C", color="grey"];
//  A -> B -> C [label="Edge"];
// }
//
// We want to obtain the lists (not correct, just to give an idea):
//  - nodes: Vec<(Node, Option<String>)> = [(A, Some("A")), (B, None), (C, Some("C"))]
//  - edges: Vec<(Edge, Option<String>)> = [(A -> B, Some("Edge")), (B -> C, Some("Edge"))]

use dot_parser::*;
use dot_parser::ast::ID;

fn extract_label<'a>(pair: (ID<'a>, ID<'a>)) -> Option<ID<'a>> {
    let label: String = pair.0.into();
    if "label" == &label {
        Some(pair.1)
    } else {
        None
    }
}

fn main() {
    let graph = ast::Graph::try_from(
        "graph {
 A[label=\"label 1 node A\", label=\"label 2 node A\"];
 B;
 C[label=\"label node C\", color=\"grey\"];
 A -> B -> C [label=\"label edges\"];
}",
    )
    .unwrap();
    let graph = graph.filter_map(&extract_label);
    let graph = canonical::Graph::from(graph);

    for node in graph.nodes.set.values() {
        println!("{} -- {}", node.id, node.attr)
    }

    for edge in graph.edges.set {
        println!("{} -> {} -- {}", edge.from, edge.to, edge.attr)
    }
}