#dot #graphviz #visual #render

tabbycat

A rust crate for generating graph scripts with dot language

4 releases

0.1.3 Apr 23, 2022
0.1.2 Dec 29, 2020
0.1.1 Jun 27, 2020
0.1.0 Jun 27, 2020

#30 in Visualization

Download history 1114/week @ 2022-10-13 2061/week @ 2022-10-20 1784/week @ 2022-10-27 2306/week @ 2022-11-03 2090/week @ 2022-11-10 1894/week @ 2022-11-17 1702/week @ 2022-11-24 2249/week @ 2022-12-01 2852/week @ 2022-12-08 2550/week @ 2022-12-15 1581/week @ 2022-12-22 1250/week @ 2022-12-29 2485/week @ 2023-01-05 2718/week @ 2023-01-12 3781/week @ 2023-01-19 2957/week @ 2023-01-26

12,310 downloads per month
Used in 7 crates (3 directly)

MIT license

100KB
3K SLoC

tabbycat

About

This crate is used to generate dot graphs with types defined in rust. The whole crate is implemented following the dot language specification listed at graphviz's website.

Attributes

There is an optional feature attributes which implemented a subset of the attributes list of the dot language. By enabling this feature, you will be able to write something like:

use tabbycat::attributes::*;
use tabbycat::AttrList;
let attrlist =  AttrList::new()
    .add_pair(fontsize(12.0))
    .add_pair(label("test"))
    .new_bracket()
    .add_pair(fillcolor(Color::Blue))
    .add_pair(arrowhead(ArrowShape::Orinv));
assert_eq!("[fontsize=12;label=\"test\";][fillcolor=blue;arrowhead=orinv;]", attrlist.to_string())

Example

use tabbycat::attributes::*;
use tabbycat::{AttrList, GraphBuilder, GraphType, Identity, StmtList, Edge, SubGraph};
let graph = GraphBuilder::default()
    .graph_type(GraphType::DiGraph)
    .strict(false)
    .id(Identity::id("G").unwrap())
    .stmts(StmtList::new()
        .add_node(Identity::id("A").unwrap(), None, Some(AttrList::new().add_pair(color(Color::Red))))
        .add_edge(Edge::head_node(Identity::id("B").unwrap(), None)
            .arrow_to_node(Identity::id("C").unwrap(), None)
            .add_attrpair(arrowhead(ArrowShape::Diamond)))
        .add_subgraph(SubGraph::subgraph(Some(Identity::id("D").unwrap()),
            StmtList::new()
                .add_edge(Edge::head_node(Identity::id("E").unwrap(), None)
                    .arrow_to_node(Identity::id("F").unwrap(), None)))))
    .build()
    .unwrap();
println!("{}", graph);

This will generate an output like:

digraph G{A[color=red;];B->C[arrowhead=diamond;];subgraph D{E->F;};}

Dependencies

~1.6–2.5MB
~62K SLoC