Home/ Questions/Q 6162621
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-23T21:41:04+00:00

I am looking to implement a Java application that will compute a set of

  • 0

I am looking to implement a Java application that will compute a set of tasks to execute. The tasks will have dependencies on each other, forming a directed graph. Is there an existing SDK or algorithm (preferably in Java) out there that will help me:

  1. Define the graph of tasks
  2. Ensure there are no cyclic dependencies in the graph
  3. Execute the tasks in the graph using a thread pool

Step 3 is the most important part. I need to execute the tasks in a parallel fashion for maximum performance yet ensure that a task isn’t executed before its dependencies.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Have a look at this previous question, which essentially suggests using JGraphT.

    It will obviously make 1) easy and has cycle detectors for part 3). Don’t think it will do part 3 for you but all you need to do is get all vertexes with an out degree (or in degree depending on your representation) of 0 and start those tasks. When a task finishes then delete the vertex from the graph and start again.

    • 0