* Learned more about BGL: interior properties effectively means they are contained by value inside the graph. External means they are not stored in the Graph.
* To be more generic, our MP (and probably Gibbs too) code should sometimes uses a vertex index map. As it is, it works only with a vector implementation for the adjacency list, which seems to contain a built-in map.
* Two bugs in the BGL, which could be a problem. remove_edge sometimes fail, and bundled properties are not implemented for subgraphs.
-> Mail the BGL list about how do you access the builtin index map for a vector
-> work on the implementation of graph partitioning
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment