Any other dependency graph?

NOTE: (Weighted) average degree of concurrency will be

more accurate for evaluating an algorithm design.

The weights of a node is the size or the amount of

work associated with the corresponding task
(Weighted) average degree of concurrency = total amount of
work / critical path length

#possibilities: 4,213,597
But if you have:
20 tasks: 51,724,158,235,372
30 tasks: 8.46 10^(23)
50 tasks: 1.85 10^(47)
100 tasks: 4.75 10^(115)

thread

thread

thread (with 1,2,6,8,9 as threads)

1818
11