dask 2021.10.0

Returns
get_all_dependencies(self) -> Dict[Hashable, AbstractSet]

This will in most cases materialize all layers, which makes it an expensive operation.

Returns

map: Mapping

A map that maps each key to its dependencies

Get dependencies of all keys

Examples

See :

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/highlevelgraph.py#805
type: <class 'function'>
Commit: