graph library in Pharo
Locked
 
|
Hi,
is there any graph library for pharo with algorithms for planarity testing, spanning trees, flow costs, etc.? Thanks, -- Peter |
|
|
There are a few algorithms in the moose distribution. Maybe you can check them.
Which algo do you really need? Cheers, Alexandre > On Nov 29, 2015, at 5:29 PM, Peter Uhnak <[hidden email]> wrote: > > Hi, > > is there any graph library for pharo with algorithms for planarity > testing, spanning trees, flow costs, etc.? > > Thanks, > -- > Peter > -- _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. |
|
|
I need at least (mixed/upward)-planarity testing, embedding, spanning
tree, flow, assignment, ... I've seen the Moose-Algos, but from what I need it contains only Kruskal (spanning tree). So ideally I would like to just load a project instead having to implement them all by myself, because most of them are very complex. Peter On Sun, Nov 29, 2015 at 11:35 PM, Alexandre Bergel <[hidden email]> wrote: > There are a few algorithms in the moose distribution. Maybe you can check them. > Which algo do you really need? > > Cheers, > Alexandre > > >> On Nov 29, 2015, at 5:29 PM, Peter Uhnak <[hidden email]> wrote: >> >> Hi, >> >> is there any graph library for pharo with algorithms for planarity >> testing, spanning trees, flow costs, etc.? >> >> Thanks, >> -- >> Peter >> > > -- > _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: > Alexandre Bergel http://www.bergel.eu > ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. > > > > |
|
|
Yes, I see your point.
Some years ago, GraphViz was bridged with Mondrian / Roassal. I do not know whether GraphViz would solve your problem or not. OSProcess was used then. Let us know how you plan to continue on that front. This is very important. Alexandre
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: Alexandre Bergel http://www.bergel.eu ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
|
Re: [Moose-dev] Re: graph library in Pharo
|
|
I'll look at the GraphViz bridge, however I would prefer direct solution.
So if I don't anything else I will start implementing it myself.... (considering the total amount of work I will most likely start with algos that are (awfully) slow, but easier to implement (I need at lest something)) Peter On Mon, Nov 30, 2015 at 2:06 PM, Alexandre Bergel <[hidden email]> wrote: > Yes, I see your point. > Some years ago, GraphViz was bridged with Mondrian / Roassal. I do not know > whether GraphViz would solve your problem or not. OSProcess was used then. > > Let us know how you plan to continue on that front. This is very important. > > Alexandre > -- > _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: > Alexandre Bergel http://www.bergel.eu > ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. > > > > On Nov 29, 2015, at 9:42 PM, Peter Uhnák <[hidden email]> wrote: > > I need at least (mixed/upward)-planarity testing, embedding, spanning > tree, flow, assignment, ... > > I've seen the Moose-Algos, but from what I need it contains only > Kruskal (spanning tree). > > So ideally I would like to just load a project instead having to > implement them all by myself, because most of them are very complex. > > Peter > > On Sun, Nov 29, 2015 at 11:35 PM, Alexandre Bergel > <[hidden email]> wrote: > > There are a few algorithms in the moose distribution. Maybe you can check > them. > Which algo do you really need? > > Cheers, > Alexandre > > > On Nov 29, 2015, at 5:29 PM, Peter Uhnak <[hidden email]> wrote: > > Hi, > > is there any graph library for pharo with algorithms for planarity > testing, spanning trees, flow costs, etc.? > > Thanks, > -- > Peter > > > -- > _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: > Alexandre Bergel http://www.bergel.eu > ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. > > > > > > > > _______________________________________________ > Moose-dev mailing list > [hidden email] > https://www.list.inf.unibe.ch/listinfo/moose-dev > |
Re: [Moose-dev] graph library in Pharo
|
|
Unfortunately, there is nothing else I know about.
But, if you would implement such algorithms, it would be a great addition. Would you consider implementing it as part of the Moose-Algos project or part of Roassal? Cheers, Doru > On Nov 30, 2015, at 2:43 PM, Peter Uhnák <[hidden email]> wrote: > > I'll look at the GraphViz bridge, however I would prefer direct solution. > > So if I don't anything else I will start implementing it myself.... > (considering the total amount of work I will most likely start with > algos that are (awfully) slow, but easier to implement (I need at lest > something)) > > Peter > > On Mon, Nov 30, 2015 at 2:06 PM, Alexandre Bergel > <[hidden email]> wrote: >> Yes, I see your point. >> Some years ago, GraphViz was bridged with Mondrian / Roassal. I do not know >> whether GraphViz would solve your problem or not. OSProcess was used then. >> >> Let us know how you plan to continue on that front. This is very important. >> >> Alexandre >> -- >> _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: >> Alexandre Bergel http://www.bergel.eu >> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >> >> >> >> On Nov 29, 2015, at 9:42 PM, Peter Uhnák <[hidden email]> wrote: >> >> I need at least (mixed/upward)-planarity testing, embedding, spanning >> tree, flow, assignment, ... >> >> I've seen the Moose-Algos, but from what I need it contains only >> Kruskal (spanning tree). >> >> So ideally I would like to just load a project instead having to >> implement them all by myself, because most of them are very complex. >> >> Peter >> >> On Sun, Nov 29, 2015 at 11:35 PM, Alexandre Bergel >> <[hidden email]> wrote: >> >> There are a few algorithms in the moose distribution. Maybe you can check >> them. >> Which algo do you really need? >> >> Cheers, >> Alexandre >> >> >> On Nov 29, 2015, at 5:29 PM, Peter Uhnak <[hidden email]> wrote: >> >> Hi, >> >> is there any graph library for pharo with algorithms for planarity >> testing, spanning trees, flow costs, etc.? >> >> Thanks, >> -- >> Peter >> >> >> -- >> _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: >> Alexandre Bergel http://www.bergel.eu >> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >> >> >> >> >> >> >> >> _______________________________________________ >> Moose-dev mailing list >> [hidden email] >> https://www.list.inf.unibe.ch/listinfo/moose-dev >> > _______________________________________________ > Moose-dev mailing list > [hidden email] > https://www.list.inf.unibe.ch/listinfo/moose-dev -- www.tudorgirba.com "Next time you see your life passing by, say 'hi' and get to know her." |
Re: [Moose-dev] graph library in Pharo
|
|
> With Guillaume Larcheveque, we tried to implement in Pharo the graph algorithm implemented in Graphiz.
Do you have some WIP code? Maybe I could salvage something? > Would you consider implementing it as part of the Moose-Algos project I will make it a separate project for now, but I can move it to Moose-Algos once it stabilizes. > or part of Roassal? The purpose of those algorithms is for better Roassal layouting, so once it's done it will have to be close. Peter |
Re: [Moose-dev] Re: graph library in Pharo
|
|
In reply to this post by Peter Uhnak
Hi Peter,
this is nice if you integrate your work with the existing moose-algo-graph infrastructure. I have design several months ago some basic complex graphs algorithms: http://smalltalkhub.com/#!/~SergeStinckwich/Moose-Algos-Graph-Generators @doru are you interrested to integrate this work in Moose ? I will check if this is working in recent Moose images. Best, On Mon, Nov 30, 2015 at 1:42 AM, Peter Uhnák <[hidden email]> wrote: > I need at least (mixed/upward)-planarity testing, embedding, spanning > tree, flow, assignment, ... > > I've seen the Moose-Algos, but from what I need it contains only > Kruskal (spanning tree). > > So ideally I would like to just load a project instead having to > implement them all by myself, because most of them are very complex. > > Peter > > On Sun, Nov 29, 2015 at 11:35 PM, Alexandre Bergel > <[hidden email]> wrote: >> There are a few algorithms in the moose distribution. Maybe you can check them. >> Which algo do you really need? >> >> Cheers, >> Alexandre >> >> >>> On Nov 29, 2015, at 5:29 PM, Peter Uhnak <[hidden email]> wrote: >>> >>> Hi, >>> >>> is there any graph library for pharo with algorithms for planarity >>> testing, spanning trees, flow costs, etc.? >>> >>> Thanks, >>> -- >>> Peter >>> >> >> -- >> _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: >> Alexandre Bergel http://www.bergel.eu >> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >> >> >> >> > _______________________________________________ > Moose-dev mailing list > [hidden email] > https://www.list.inf.unibe.ch/listinfo/moose-dev -- Serge Stinckwich UCBN & UMI UMMISCO 209 (IRD/UPMC) Every DSL ends up being Smalltalk http://www.doesnotunderstand.org/ |
Re: [Moose-dev] graph library in Pharo
|
|
Hi,
> On Dec 1, 2015, at 9:17 AM, Serge Stinckwich <[hidden email]> wrote: > > Hi Peter, > > this is nice if you integrate your work with the existing > moose-algo-graph infrastructure. > > I have design several months ago some basic complex graphs algorithms: > http://smalltalkhub.com/#!/~SergeStinckwich/Moose-Algos-Graph-Generators > @doru are you interrested to integrate this work in Moose ? Definitely! > I will check if this is working in recent Moose images. Great. Please let me know if it works. Cheers, Doru > Best, > > On Mon, Nov 30, 2015 at 1:42 AM, Peter Uhnák <[hidden email]> wrote: >> I need at least (mixed/upward)-planarity testing, embedding, spanning >> tree, flow, assignment, ... >> >> I've seen the Moose-Algos, but from what I need it contains only >> Kruskal (spanning tree). >> >> So ideally I would like to just load a project instead having to >> implement them all by myself, because most of them are very complex. >> >> Peter >> >> On Sun, Nov 29, 2015 at 11:35 PM, Alexandre Bergel >> <[hidden email]> wrote: >>> There are a few algorithms in the moose distribution. Maybe you can check them. >>> Which algo do you really need? >>> >>> Cheers, >>> Alexandre >>> >>> >>>> On Nov 29, 2015, at 5:29 PM, Peter Uhnak <[hidden email]> wrote: >>>> >>>> Hi, >>>> >>>> is there any graph library for pharo with algorithms for planarity >>>> testing, spanning trees, flow costs, etc.? >>>> >>>> Thanks, >>>> -- >>>> Peter >>>> >>> >>> -- >>> _,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;: >>> Alexandre Bergel http://www.bergel.eu >>> ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;. >>> >>> >>> >>> >> _______________________________________________ >> Moose-dev mailing list >> [hidden email] >> https://www.list.inf.unibe.ch/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 > [hidden email] > https://www.list.inf.unibe.ch/listinfo/moose-dev -- www.tudorgirba.com "We are all great at making mistakes." |
«
Return to Pharo Smalltalk Users
|
1 view|%1 views
| Free forum by Nabble | Edit this page |