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.bergel@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.uhnak@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 ^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.

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.bergel@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.uhnak@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.bergel@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.uhnak@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-dev@list.inf.unibe.ch https://www.list.inf.unibe.ch/listinfo/moose-dev

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

---

Moose-dev mailing list Moose-dev@list.inf.unibe.ch 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."

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 i.uhnak@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.bergel@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.uhnak@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-dev@list.inf.unibe.ch https://www.list.inf.unibe.ch/listinfo/moose-dev