Boost logo

Boost :

Subject: Re: [boost] Boost.Graph for GSoC
From: Tim Keitt (tkeitt_at_[hidden])
Date: 2013-04-08 12:40:48

Just want to follow up on Daniel's post. Daniel works in my lab and is an
exceptionally good C++ programmer. I am available to mentor. This work is
in collaboration with Philip Kein at Rutgers who is writing a book on
planar graph algorithms. I will ask Phil if he is interested in


On Mon, Apr 8, 2013 at 11:32 AM, Daniel Mitchell <
dlm.bulk.messages_at_[hidden]> wrote:

> Hi all, I'm a researcher and graduate student at the University of Texas
> at Austin and I'm interested in doing a Boost.Graph project for GSoC. I was
> thinking of doing one or more planar graph algorithms, in particular the
> multiple source shortest paths algorithm for planar graphs described at
> The algorithm assumes that the sources are located on a single face. It
> proceeds by calculating the shortest paths tree from one source and then
> minimally modifying the tree to efficiently get the shortest paths from the
> other sources. The algorithm uses a dynamic tree data structure, so
> developing that data structure would be part of the project too.
> I've made prior contributions to BGL. I worked with Doug Gregor to
> implement color maps for the breadth first and Dijkstra's algorithms. One
> of my current areas of research is movement ecology, where planar graphs
> can be used to study movement.
> Let me know what you think.
> Daniel Mitchell
> _______________________________________________
> Unsubscribe & other changes:


Boost list run by bdawes at, gregod at, cpdaniel at, john at