[igraph] chosing a graph library

[ohad barta]

Hi

 

I am a research assistant at the technion, and I have to choose a graph library to work with. Can you please tell me when this library is more efficient then other libraries, such as BGL or LEMON? In particular, my use of graphs will be mainly routing (i.e. express permutations by disjoint paths on de bruijn graphs), Is that library more efficient when dealing with de bruijn graphs?

 

Thanks in advance

 

Ohad Barta