13 May
2012
13 May
'12
3:21 p.m.
On Sun, 13 May 2012 06:37:01 -0700 Steven Watanabe <watanabesj@gmail.com> wrote:
topological sort only works if you assume that each task is completed before the next one starts. To run tasks in parallel you have to maintain a queue of tasks that are ready to run and add tasks to it as their dependencies complete. It isn't terribly difficult, but it's more complex than a straight topological sort. If that's the whole point then I apologize for using incorrect and misleading terminology.