best data structure to resolve dependencies between tasks

Question

I am developing a code for a robot which is supposed to make a product. The process is composed of many tasks. each task may or may not depend on other tasks. I am wondering if there is a better approach than using trees or it's the perfect data structure for it.

Sounds like a DAG, not a tree to me.

amit
– amit

2016-06-04 15:31:39 +00:00
Commented Jun 4, 2016 at 15:31 — amit
– amit, Commented Jun 4, 2016 at 15:31

Mukul Gupta · Accepted Answer · 2016-06-04 18:05:30Z

6

I think you need a directed acyclic graph for your use-case.

To determine the order of execution of your tasks, you could use a topological sort on the DAG.

answered Jun 4, 2016 at 18:05

Mukul Gupta

2,4654 gold badges25 silver badges39 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Sagar Bonde · Accepted Answer · 2020-02-27 22:55:25Z

1

You can also use Adjoint set Datastructure. By using Union find you can resolve dependencies and find an ordered path. Besides that the Time complexity of Adding or removing an element from an Adjoint set is O(1) hence it will take care of the changing requirement

answered Feb 27, 2020 at 22:55

Sagar Bonde

414 bronze badges

Collectives™ on Stack Overflow

best data structure to resolve dependencies between tasks

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related