ndependencies(dependencies, dependents)

For each key we return the number of tasks that must be run for us to run this task.

Returns

num_dependencies: Dict[key, int]

total_dependencies: Dict[key, int]

Number of total data elements on which this key depends

Examples

This example is valid syntax, but we were not able to check execution

>>> dsk = {'a': 1, 'b': (inc, 'a'), 'c': (inc, 'b')}
... dependencies, dependents = get_deps(dsk)
... num_dependencies, total_dependencies = ndependencies(dependencies, dependents)
... sorted(total_dependencies.items())
[('a', 1), ('b', 2), ('c', 3)]

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

dask.order.ndependencies

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

File: /dask/order.py#934
type: <class 'function'>
Commit: