* Learned about the subgraph feature of BGL. Seems OK, but we will definitely need bundled properties...
* Learned more about properties map (again). You can access them, in an adjacency list, with the get() function. It suddenly make more sense. I think I begin to have a good understanding of the BGL.
* Made a first attempt at an implementation of graph partitioning. It seems to have a backtrack size of 1 (the backtrack is not cleanly coded though). It should have all the functionality of the previous work, except the simplification of one and two connectivity (which is important).
-> finish the first implementation (shouldn't require long). Compile and test
-> review Gibbs sampler, and MP code (optimize, etc...)
-> still need to learn about (nested) typedefs
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment