Question to all: Would it make sense to have Serge’s package into Moose?
@ Serge: Is your code dependent on Moose? If no, how large is it? Maybe we could add it to Roassal.
Alexandre
On Apr 9, 2015, at 12:36 PM, Serge Stinckwich serge.stinckwich@gmail.com wrote:
I can integrate my own graph generators if you want :
http://smalltalkhub.com/#!/~SergeStinckwich/Moose-Algos-Graph-Generators
On Wed, Apr 8, 2015 at 5:53 PM, Christophe Demarey Christophe.Demarey@inria.fr wrote:
Hi,
A few days ago, I added new graph algorithms into MooseAlgos but I did not communicate about that. I added 2 complementary algorithms:
- MalGraphReducer : it takes as input a graph and ouputs a graph without circuits. Nodes forming a circuit (or cycle if you prefer) are merged into a single node. A merge node has a reference to merged nodes. It uses the MalTarjan algorithm.
- MalTopologicalSorting : the well known graph sorting algorithm that can only be applied on graphs without circuits (cycles).
the latter could be useful for some layouting strategies of graphs for example.
Regards, Christophe. _______________________________________________ Moose-dev mailing list Moose-dev@iam.unibe.ch https://www.iam.unibe.ch/mailman/listinfo/moose-dev
-- Serge Stinckwich UCBN & UMI UMMISCO 209 (IRD/UPMC) Every DSL ends up being Smalltalk http://www.doesnotunderstand.org/ _______________________________________________ Moose-dev mailing list Moose-dev@iam.unibe.ch https://www.iam.unibe.ch/mailman/listinfo/moose-dev