Need help in finding an efficient algorithm

[robertday5]

Need help in finding an efficient algorithm for the following problem.
There are tasks which have predecessor tasks which needs to be
completed before taking up the new task.
Our aim is to find the required order of the tasks, so that the
pre-requisite tasks are always completed before the task.
For example

TaskA needs taskJ and taskK
TaskB needs none
TaskC needs TaskA, taskK
taskD needs taskB
taskJ needs taskB
taskK needs none

There is no cyclical dependency and all the tasks take same amount of
time

A valid answer can be
taskB
taskK
taskJ
taskD
taskC
taskA

 

[Anno Siegel]

Need help in finding an efficient algorithm for the following problem.
There are tasks which have predecessor tasks which needs to be
completed before taking up the new task.
Our aim is to find the required order of the tasks, so that the
pre-requisite tasks are always completed before the task.
For example

TaskA needs taskJ and taskK
TaskB needs none
TaskC needs TaskA, taskK
taskD needs taskB
taskJ needs taskB
taskK needs none

There is no cyclical dependency and all the tasks take same amount of
time

A valid answer can be
taskB
taskK
taskJ
taskD
taskC
taskA

Google for "topological sort". I think there is a CPAN module for that,
but it must be named differently.

Anno

 

[Sherm Pendley]

I think there is a CPAN module for that,

Yep!

Sort::Topological

sherm--

 

[Anno Siegel]

Yep!

Sort::Topological

That's what I thought I searched for, but didn't find it. Now I do.
Well, "topological" is hard to type

Anno