Hi, My name is Augustus Odena. I'm really interested in a few of the project ideas that Boost has listed for Google Summer of Code (Heaps and Queues, Bits and Ints, Graph Connectives and Topology Generators). It was suggested to me by the Hints Page that I should join the mailing list - so I've done that. I'd really appreciate it if, whenever someone had the time, they could perhaps fill me in a little bit more on the details behind those projects and their relative merits. I'd be happy to provide any sort of information about myself that would be helpful. -- Thanks, Augie Odena
My name is Augustus Odena. I'm really interested in a few of the project ideas that Boost has listed for Google Summer of Code (Heaps and Queues, Bits and Ints, Graph Connectives and Topology Generators). It was suggested to me by the Hints Page that I should join the mailing list - so I've done that. I'd really appreciate it if, whenever someone had the time, they could perhaps fill me in a little bit more on the details behind those projects and their relative merits. I'd be happy to provide any sort of information about myself that would be helpful.
Hi Augustus, I'd be happy to answer specific questions if you have any. For the Heaps and Queues project you might want to look at the boost/pending directory and in the sandbox libs/pri_queue (IIRC). The BGL projects require a pretty good working knowledge of the BGL and its concepts. It looks like the Bits and Ints project may actually be two different projects--one working with compact data representations and the other building a library for integer programming. Andrew Sutton andrew.n.sutton@gmail.com
I'd be happy to answer specific questions if you have any.
Andrew, Thanks, I have two. First - to what extent could familiarity with graphs and graph algorithms in general compensate for a lack of experience with BGL (I've none of the latter, but a fair bit of the former)? Second, would Boost entertain multiple proposals from one candidate or would you suggest I keep it to one? On Fri, Mar 19, 2010 at 9:01 AM, Andrew Sutton <andrew.n.sutton@gmail.com>wrote:
My name is Augustus Odena. I'm really interested in a few of the project ideas that Boost has listed for Google Summer of Code (Heaps and Queues, Bits and Ints, Graph Connectives and Topology Generators). It was suggested to me by the Hints Page that I should join the mailing list - so I've done that. I'd really appreciate it if, whenever someone had the time, they could perhaps fill me in a little bit more on the details behind those projects and their relative merits. I'd be happy to provide any sort of information about myself that would be helpful.
Hi Augustus,
I'd be happy to answer specific questions if you have any. For the Heaps and Queues project you might want to look at the boost/pending directory and in the sandbox libs/pri_queue (IIRC). The BGL projects require a pretty good working knowledge of the BGL and its concepts. It looks like the Bits and Ints project may actually be two different projects--one working with compact data representations and the other building a library for integer programming.
Andrew Sutton andrew.n.sutton@gmail.com _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
-- Thanks, Augie Odena
Thanks, I have two. First - to what extent could familiarity with graphs and graph algorithms in general compensate for a lack of experience with BGL (I've none of the latter, but a fair bit of the former)? Second, would Boost entertain multiple proposals from one candidate or would you suggest I keep it to one?
Experience with the BGL is pretty important for a proposal. It's not quite like other libraries. If you're interested, I would try to work through a couple examples. I don't think there are any restrictions on the number of proposals you can write. I certainly don't have a problem with students submitting multiple proposals. Andrew Sutton andrew.n.sutton@gmail.com
participants (2)
-
Andrew Sutton -
Augustus Q Odena