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 |
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 <[hidden email]> 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 ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. |
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 <[hidden email]> 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 <[hidden email]> 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 > ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. > > > > |
Christophe, Alexandre, i will give it a try .... How can i load "Moose-Tests-Algos-Graph" into Pharo 5.0?
Thanks, Volkert On 25.04.2016 10:23, Christophe Demarey wrote: > 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 <[hidden email]> 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 <[hidden email]> 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 >> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >> >> >> >> > |
Metacello new
configuration: 'MooseAlgos'; smalltalkhubUser: 'Moose' project: 'MooseAlgos'; version: #bleedingEdge; load: 'Moose-Tests-Algos-Graph' > Le 25 avr. 2016 à 18:52, Volkert <[hidden email]> a écrit : > > Christophe, Alexandre, i will give it a try .... How can i load "Moose-Tests-Algos-Graph" into Pharo 5.0? > > Thanks, Volkert > > On 25.04.2016 10:23, Christophe Demarey wrote: >> 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 <[hidden email]> 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 <[hidden email]> 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 >>> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >>> >>> >>> >>> >> > > |
Metacello new
configuration: 'MooseAlgos'; smalltalkhubUser: 'Moose' project: 'MooseAlgos'; version: #development; load: 'Moose-Tests-Algos-Graph’ On Apr 28, 2016, at 10:21 AM, Christophe Demarey <[hidden email]> wrote: -- www.tudorgirba.com www.feenk.com "Not knowing how to do something is not an argument for how it cannot be done." |
Free forum by Nabble | Edit this page |