| 1 | digraph participants { |
|---|
| 2 | a [label="added n/a", color="#dddddd"]; |
|---|
| 3 | b [label="added present"]; |
|---|
| 4 | c [label="invited n/a", color="#dddddd"]; |
|---|
| 5 | d [label="invited n/a"]; |
|---|
| 6 | e [label="accepted n/a", color="#dddddd"]; |
|---|
| 7 | f [label="accepted present"]; |
|---|
| 8 | g [label="rejected n/a", color="#dddddd"]; |
|---|
| 9 | h [label="rejected n/a"]; |
|---|
| 10 | i [label="accepted absent"]; |
|---|
| 11 | j [label="added absent"]; |
|---|
| 12 | k [label="excused n/a"]; |
|---|
| 13 | l [label="I", shape="box", color="#dddddd", style="filled"]; |
|---|
| 14 | |
|---|
| 15 | a -> b; |
|---|
| 16 | b -> j [label="set as absent"]; |
|---|
| 17 | j -> b [label="set as present"]; |
|---|
| 18 | c -> d; |
|---|
| 19 | c -> g [label="reject"]; |
|---|
| 20 | c -> e [label="accept"]; |
|---|
| 21 | d -> f [label="accept"]; |
|---|
| 22 | d -> h [label="reject"]; |
|---|
| 23 | e -> f; |
|---|
| 24 | g -> h; |
|---|
| 25 | f -> i [label="set as absent"]; |
|---|
| 26 | i -> f [label="set as present"]; |
|---|
| 27 | j -> k [label="excuse absence"]; |
|---|
| 28 | i -> k [label="excuse absence"]; |
|---|
| 29 | |
|---|
| 30 | l -> b; |
|---|
| 31 | l -> a; |
|---|
| 32 | l -> c; |
|---|
| 33 | |
|---|
| 34 | {rank=same; a c} |
|---|
| 35 | {rank=same; e g} |
|---|
| 36 | } |
|---|