I\'m trying to decide between going with a pre-made graph/node network library or to roll my own.
I\'m implementing some graph search algorithms which might require
I recently gave the boost graph library a trial for Dijkstras shortest path problem. Results:
Very High performance
Very little code needed
Very flexible and extensible
Hard to understand or debug
Advice: Use it but before you do so read The Boost Graph Library: User Guide and Reference Manual