Currently the graph types are bound to be sub-type of the Edges and Nodes and the type parameters have to be carried around. These creates lots of boilerplate and limits the flexibility of the API and algorithms. To solve that, a type class based approach seems to be a reasonable idea.
Currently the graph types are bound to be sub-type of the Edges and Nodes and the type parameters have to be carried around. These creates lots of boilerplate and limits the flexibility of the API and algorithms. To solve that, a type class based approach seems to be a reasonable idea.