dep-graph 0.1.5

Dependency graph resolver library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

Dependency Graph
================

This is a rust library to perform iterative operations over dependency graphs.

## Usage

```toml
[dependencies]
depgraph = "0.1"
```

This library supports both sequential and parallel (multi-threaded) operations out of the box. By default, multi-threaded operations will run a number of threads equal to the number of cores.

### Parallel operations

Here is a simple example on how to use this library:

```rust
use dep_graph::{Node, DepGraph,StrNode};
use rayon::prelude::*;

fn my_graph() {
    // Create a list of nodes
    let mut root = StrNode::new("root");
    let mut dep1 = StrNode::new("dep1");
    let mut dep2 = StrNode::new("dep2");
    let leaf = StrNode::new("leaf");

    // Map their connections
    root.add_dep(dep1.id());
    root.add_dep(dep2.id());
    dep1.add_dep(leaf.id());
    dep2.add_dep(leaf.id());

    // Create a graph
    let nodes = vec![root, dep1, dep2, leaf];
    let graph = DepGraph::new(&nodes);

    // Run an operation over all nodes in the graph.
    // The function receives the identity value from the node, not the
    // entire node (e.g. "root", "dep1", etc. in this case).
    graph
        .into_par_iter()
        .for_each(|node| {
            println!("{}", *node)
        });
}
```