What's the timeline for BGL-algorithms proposal? My idea is to submit two kind of algorithms as solution of the same problem, two-graphs common-tree problem, where the latter is the refinement of the former (better performance, about 300%!). Authors are Grimbleby for the former, and Schach for the latter. MRT-based (Schach) implementation is ready, generic as BGL algorithms need to be, and it works fine (I use it in my degree thesis). I've not found since January/February a little bit of time to develop the other algorithm, I'm very sorry. However, I can write down not-generalized pseudo-code for the Grimbleby algorithm (to drive to C++ code, of course), and submit the one by Schach, as-is.
What about this way?
Student submissions don't start for a couple of weeks so there's a lot of time to refine your proposal. The actual SoC timeline is here: http://socghop.appspot.com/document/show/gsoc_program/google/gsoc2010/timeli... Hit the HTML link for a Google Calendar, if you want a more informative view. Andrew Sutton andrew.n.sutton@gmail.com