Hi,
I'm curious about the design decisions behind Moose Graph Algorithms.
Basically each algorithm (or at least many of them) has their own
separate class for edges and/or vertices.
This in theory makes the code more descriptive, however it also makes
integration between various algorithms much harder, because now if I
want to run two different algorithms on a single graph I have to
convert them to the appropriate format.
Wouldn't it make more sense to have the necessary behavior pluggable
and have only a single representation of a graph?
I'm sure there some other benefits to the current approach, however I
do not see them.
So all in all I would like to have a perhaps more functional (as in
function) approach, as that more closely matches the mathematics
behind the algorithm(s).
Peter