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 <alexandre.ber...@me.com> 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 <i.uh...@gmail.com> 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 > <alexandre.ber...@me.com> 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 <i.uh...@gmail.com> 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 > moose-...@list.inf.unibe.ch > https://www.list.inf.unibe.ch/listinfo/moose-dev >