Does anyone know about the implementation of graph algorithms in Smalltalk?
I need something that allows you to implement an interface on your model objects or something else, and provides algorithms for transitive closure, transitive reduction, topological sorting, etc. etc.
People end up repeating these widely applicable algorithms often, it would be great to have a universal implementation accessible to everyone.
Pointers to a similar library for other (preferably OO) languages that could be ported would also be useful, I think.
source
share