This abstract class establish a protocol for high level graph layers.
The main motivation of a layer is to represent a collection of tasks symbolically in order to speedup a series of operations significantly. Ideally, a layer should stay in this symbolic state until execution but in practice some operations will force the layer to generate all its internal tasks. We say that the layer has been materialized.
Most of the default implementations in this class will materialize the layer. It is up to derived classes to implement non-materializing implementations.
High level graph layer
The following pages refer to to this document either explicitly or contain code examples using this.
dask.highlevelgraph.MaterializedLayer
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