From: Wang Weiwei (wwwang_at_[hidden])
Date: 2006-07-10 23:15:08
I'm starting to make use of the BGL in one of my projects. It was learnt from the documentation that there were basically 2 forms of representations of a graph:
- adjacency-list, and
The latter is normally more suitable for denser graphs.
My question is, Is ther any function that can shift the graph from between these two forms of data structure?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk