futures-dagtask

A task queue based on a directed acyclic graph that allows you to specify dependencies for concurrent tasks.

Usage

```rust use futures::future; use futures_dagtask::TaskGraph;

let mut graph = TaskGraph::new(); let zero = graph.addtask(&[], future::ready::(0))?; let one = graph.addtask(&[], future::ready::(1))?; let two = graph.add_task(&[one], future::ready::(2))?;

let (add, exec) = graph.execute();

// spawn(exec.for_each(drop));

let three = add.addtask(&[two], future::ready(3)).await?; ```

In this example, zero and one will be executed concurrently, but two will be executed after one is completed.

Due to the simplicity of design, we will never have circular dependencies.

License

This project is licensed under the MIT license.