go-hep.org/x/hep@v0.38.1/fwk/testdata/simple_dflow.dot.golden (about)

     1  strict digraph dataflow {
     2    // Node definitions.
     3    1 [
     4      "node"="data"
     5      "label"="t0-ints1"
     6    ];
     7    2 [
     8      "node"="data"
     9      "label"="t0-ints2"
    10    ];
    11    3 [
    12      "node"="data"
    13      "label"="t1-ints1"
    14    ];
    15    4 [
    16      "node"="data"
    17      "label"="t1-ints1-massaged"
    18    ];
    19    5 [
    20      "node"="data"
    21      "label"="t2-ints2"
    22    ];
    23    6 [
    24      "node"="task"
    25      "shape"="component"
    26      "label"="t0"
    27    ];
    28    7 [
    29      "node"="task"
    30      "shape"="component"
    31      "label"="t1"
    32    ];
    33    8 [
    34      "node"="task"
    35      "shape"="component"
    36      "label"="t2"
    37    ];
    38  
    39    // Edge definitions.
    40    3 -> 8;
    41    6 -> 1;
    42    6 -> 2;
    43    7 -> 3;
    44    7 -> 5;
    45    8 -> 4;
    46  }