I think that implementing combinatorial algorithms to meet needs like Paul's and Herve's below
would make a good addition to [math]. Starting with clean room implementations of algorithms
to meet specific practical needs would be a better way to go than translating or porting existing
libraries, IMHO.
Can you guys provide a little more detail on what your application needs are?
Phil
Original Message
From: Allen Lee [mailto:alllee@cs.indiana.edu]
Sent: Mon 4/19/2004 1:14 PM
To: Jakarta Commons Developers List
Cc:
Subject: Re: [math] Graph theory
I've always thought something similar to the boost graph library
(http://www.boost.org/libs/graph/doc/index.html) would be useful. Now that
Java has generics as well it might be an easier firstcut translation...
On Mon, Apr 19, 2004 at 09:50:11PM +0200, Paul Libbrecht wrote:
> How do you compare your package to jGraph (which does not only drawing)
> and othr packages that do visual drawing at the same time as other
> functionalities.
>
> Maybe the name "graphtheory" is a bit vague... for exampe, I know I've
> been looking very long for a package that could allow me to build
> combinatorial graphs and would then allow me to compute the distance
> between subsets... I've never found that.
>
> paul
>
>
> On 19Apr04, at 21:07 Uhr, Herve Quiroz wrote:
>
> >Hi,
> >
> >
> >Is there something planned regarding graph theory within the [math]
> >project?
> >
> >I'm asking because I'm coding a network simulator and I have been
> >looking for such a package for a while. Now I've implemented my own
> >(quite limited and specific) package. Still, if someone already planned
> >something similar in the [math] package, I may contribute instead of
> >reinventing the wheel (once again)...
> >
> >Herve
