Re: [boost] Gsoc Boost.Graph: implementing new algorithms

Subject: Re: [boost] Gsoc Boost.Graph: implementing new algorithms
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2010-04-06 09:52:23

for mixed graph I mean a graph with both directed and undirected
> edges. I'm sure there are some valid considerations that devolopers
> did to not implement it but some real-life problems (I'm thinking to
> routing algorithms) would benefit from that.
>

I see... That is interesting. How are you proposing to solve this problem?
I've never really thought about it :)

> I would like to submit to the BGL in particular the euler tour
> algorithm and the minimum cost maximum matching algorithm because I
> think they could be very useful. Just now I'm studying what data
> structures I need to implement it and how visitors could be useful in
> that algorithm. Do you think it could be useful write an interface to
> insert in the submission?
>

These two algorithms alone would constitute a good GSoC proposal (with an
option for the 3rd, perhaps). These algorithms can be very hard to get
right. You could suggest an interface in the proposal. It would help show
what you're trying to do.

Andrew Sutton
andrew.n.sutton_at_[hidden]