Hi, Moose-Algos-Graph contains very classical algorithmes applying on graphes (Breadth-first search, dijkstra, tarjan, topological sorting, etc). It is now in Pharo 5 because it is used by the dependency analyser. As Alexandre said, there are almost no documentation and it is not so easy to combine algorithms (run an algo on the output of another algo). You can look at Moose-Tests-Algos-Graph package (to be loaded) and DADependencyChecker>>#shortestPathToPackageIntroducingDependency:startingFrom: for some examples.
Christophe > Le 24 avr. 2016 à 20:55, Alexandre Bergel <alexandre.ber...@me.com> a écrit : > > Hi Volkert! > > This package contains some classical graph algorithms we use in software > analysis (e.g., clustering, strong component). > Unfortunately, there is no much documentation about it. If you are using > these algorithms, then it would be great to write some documentation. > > In addition to this package, and as you know, Roassal offers many layout > algorithms. > > Regarding, > Alexandre > >> On Apr 24, 2016, at 6:39 AM, Volkert <volk...@komponentenwerkstatt.de> wrote: >> >> Dear all, >> >> if have found the "Moose-Algos-Graph" package in Pharo 5. What is the idea >> behind this package? Is this "the" official Pharo Graph Library? >> Do we have some examples how to use it? >> >> LG, >> Volkert >> > > -- > _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: > Alexandre Bergel http://www.bergel.eu > ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. > > > >
