8 Apr
2015
8 Apr
'15
5:59 p.m.
Hi!
Can you provide some (graphical) illustrations about the graph algo?
I know that Moose has some, but they are presented in a very cryptic way.
Graph algos are very important, and we are seriously under-using them.
Cheers, Alexandre
On Apr 8, 2015, at 12: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
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.