Boost.Graph for GSoC 2013 - Yes/No/Maybe?
Hi all, I'd like to gauge the interest in proposing a project in Boost.Graph for GSoC (and beyond). Would anyone be interested in additions to Boost.Graph? (to-do list here hasn't changed in a while: http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/challenge.html). If so, what exactly would you be interested in? Also, would anyone be open to mentoring for this project?
I think that would be a great addition. Items like Qhull, mincos/max flow and
algorithm objects seems to be very relevant to what students could expect from
a GSOC project.
Yes please add it.
Best,
David
On Sun, Mar 10, 2013 at 8:06 PM, Darius L.
Hi all,
I'd like to gauge the interest in proposing a project in Boost.Graph for GSoC (and beyond). Would anyone be interested in additions to Boost.Graph? (to-do list here hasn't changed in a while: http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/challenge.html). If so, what exactly would you be interested in? Also, would anyone be open to mentoring for this project?
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
On Mon, 11 Mar 2013, David Bellot wrote:
I think that would be a great addition. Items like Qhull, mincos/max flow and algorithm objects seems to be very relevant to what students could expect from a GSOC project. Yes please add it.
I agree as well. There are lists of projects at: https://svn.boost.org/trac/boost/wiki (look at the links under "Projects"); the 2009, 2010, and 2012 lists, in particular, have many Boost.Graph projects). https://svn.boost.org/trac/boost/wiki/GraphVersion2 http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Google_Summer... (four projects there, but the third has already been done) http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/challenge.html Several of us can come up with even more projects if you'd like more ideas than what are in those lists. -- Jeremiah Willcock
Darius L.
Would anyone be interested in additions to Boost.Graph?
Hi all, I'm a researcher/graduate student at University of Texas at Austin and I'm interested in doing a boost.graph project for GSoC. My supervisor can mentor. I was thinking of the multiple source shortest path algorithm for planar graphs described at http://courses.csail.mit.edu/6.889/fall11/lectures/L11.html The algorithm assumes that all the sources are located on a single face. It proceeds by calculating the shortest paths tree from one source and then modifying the tree to efficiently get the shortest paths from the other sources. Any thoughts? Daniel Mitchell
participants (4)
-
Daniel Mitchell -
Darius L. -
David Bellot -
Jeremiah Willcock