Subject: [boost] GSoC 2012
From: Devashish Tyagi (devashishrocker_at_[hidden])
Date: 2012-03-14 08:54:54
I am Devashish Tyagi, an Undergraduate Student of Computer Science and
Engineering at Indian Institute of Technology, Delhi. I am currently in my
Third Year. I have a considerable experience of coding in C++ and strong
background in the field of Algorithms. I would like to be part of Boost C++
Library for GSoC 2012.
I went through the Ideas page
I would like to extend Boost.Graph by implementing the requests mentioned
on this page<http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html>.
Among the Challenges mentioned, I am particularly interested in
implementing Dynamic Graph Algorithms and a minimum cost maximum flow
Algorithm. Could someone guide me as to from where should I begin my
research and Is there a priority order among the requests/challanges
mentioned on this
-- Devashish Tyagi 2nd Year Undergraduate Computer Science and Engineering Dept.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk