Chainlet Mini Language

Linking chainlets can be done using a simple grammar based on >> and << operators [1]. These are used to create a directed connection between nodes. You can even include forks and joins easily.

a >> b >> (c >> d, e >> f) >> g

This example links elements to form a directed graph:

digraph graphname {
    graph [rankdir=LR, bgcolor="transparent"]
    a -> b
    b -> c -> d
    b -> e -> f
    f -> g
    d -> g
}

Advanced Linking Rules

Linking only guarantees element identity and a specific data flow graph. This reflects that some dataflows which can be realised in multiple ways. Several advanced rules allow chainlet to superseed the default link process.