Hello,<br><div class="gmail_quote"><div>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.</div>

<div><br>I went through the Ideas page <a href="https://svn.boost.org/trac/boost/wiki/SoC2012" target="_blank">here</a>. I would like to extend Boost.Graph by implementing the requests mentioned on this <a href="http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html" target="_blank">page</a>. 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 <a href="http://www.boost.org/doc/libs/1_49_0/libs/graph/doc/challenge.html" target="_blank">page</a>. </div>

<div> </div><div>Regards<span class="HOEnZb"><font color="#888888"><br>-- <br>Devashish Tyagi</font></span></div><div><span class="HOEnZb"><font color="#888888">Junior Undergraduate<br>Computer Science and Engineering Dept. <br>
</font></span></div></div><br>