[Coin-discuss] Interest in a graph/network library?

[Leo Lopes]

Personally I think this is a great contribution. I also think that if
you add it, people will contribute in many ways, from adding
algorithms to updating the trac, etc.

Cheers,
Leo.

On 7/25/06, Darla and Philip Walton <hpwalton at comcast.net> wrote:
>
>
> All,
> I have an STL-template based network/graph library I've had for years.  Is
> there interest in having such a thing in COIN-OR?
> It compiles on Linux and MSVC8 (and will very likely work under others.)
>
> The discussions at the DIMACS COIN-OR Workshop inspired me to dust it off
> and get it compiling/running on the latest g++ and MSVC compilers.  I don't
> think it would take much to get it to comply with COIN-OR requirements.
>
> Right now it consists of a couple of graph representations, and several
> algorhithms to go with it.
>
> Graph types:
> - static network (vector based)
> - dynamic network (list based)
> - undirected static network (vector based)
>
> Algorithm types:
> - Shortest path
> - Min spanning tree
> - Max Flow
> - Min cost flow
> - Traversals
> ...
>
> I'd like to gauge interest in adding this to COIN-OR.  Any thoughts?
>
> Philip
> _______________________________________________
> Coin-discuss mailing list
> Coin-discuss at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/coin-discuss
>
>
>


-- 
========================================================================
Leonardo B. Lopes                                    leo at sie.arizona.edu
Assistant Professor                                        (520)621-2342
SIE - University of Arizona  http://www.sie.arizona.edu/faculty/leolopes