3 ms·
>prevents diamond shapes Pretty much this, unless I'm missing something. An earlier version of the program actually used DAGs, but I found it a little undercon
by climech 6y ago
>prevents diamond shapes
Pretty much this, unless I'm missing something. An earlier version of the program actually used DAGs, but I found it a little underconstrained. I got pretty excited when I discovered multitrees, as it seemed to be exactly what I needed the whole time.
- gradys 6y agoWhy is the no diamond constraint useful here?
- climech 6y agoWithout it, the structure allowed the user to create a graph like this: [x] Task ├──[x] Sub-task (1) │ ├──[x] Sub-sub-task (2) │ └──[x] Sub-sub-task ├──[x] Sub-task (3) │ ├──[x] Sub-sub-task (2) │ └──[x] Sub-sub-task └──[x] Sub-task by creating a link from (3) to (2). The tree command would actually omit the second occurrence of (2), since the algorithm visited each node just once.