title: choosing a c++ graph library
body: <p>I'm currently looking for a c++ graph library. (I saw already all the different posts here but my requierments are totally different).</p>
  
  <p>With the help of the library I will have to create a some graphs (that are isomorphic to bennes network), and apply on them the bennes  network routing algorithm (In case that you are interested , the algorithm can be <a href="http://www.cs.nmsu.edu/~pfeiffer/classes/573/sem/s05/presentations/Paper22.pdf" rel="noreferrer">found here. However, understanding it has nothing to do with answer on my question</a>.)  (what you have to know about it just for get an idea of how the code will look like is that this is a simple action that involves only creating a graph and making some queries, without any complex algorithms involved).</p>
  
  <p>Now, my top-3 libraries are of course:</p>
  
  <p>BGL <a href="http://www.boost.org/doc/libs/1_48_0/libs/graph/doc/index.html" rel="noreferrer">BGL link</a></p>
  
  <p>LEMON <a href="http://lemon.cs.elte.hu/trac/lemon" rel="noreferrer">LEMON link</a> and</p>
  
  <p>igraph <a href="http://igraph.sourceforge.net/" rel="noreferrer">igraph link</a>.</p>
  
  <p>Since I will have to work with huge graphs, I'm looking desperatly for some benchmarks. I saw a <a href="http://lemon.cs.elte.hu/pub/doc/lemon-intro-presentation.pdf" rel="noreferrer">representation</a> of LEMON where they claim to be better then BGL on that aspect, but I didn't find any benchmarks that include igraph (and since igraph has much more functions that are relevant to me compared to BGL and LEMON this is a library that I would be happy to use in case that it is efficient enough).</p>
  
  <p>Does anyone here knows on such benchmarks (or some top important adavantages/disadvantages that I might be missing) and can share his findings with me? 
  Thank you very much!</p>