1 - Idea: a FactorGraph and a RegionGraph are often equipped with
2 extra properties for nodes and edges. The code to initialize those
3 is often quite similar; maybe this can be abstracted to classes
4 like ExtFactorGraph and ExtRegionGraph (Ext stands for Extended), e.g.
5 template <typename NodeProperties, typename EdgeProperties>
6 class ExtFactorGraph : public FactorGraph {
8 std::vector<NodeProperties> nodeProps;
9 std::vector<std::vector<EdgeProperties> > edgeProps;
12 A disadvantage of this approach may be worse cachability.
13 A problem is if there are nog properties for nodes (type 1), nodes (type 2)
14 or edges. Maybe this can be solved using specializations, or using variadac
15 template arguments or something similar?
16 - BipartiteGraph::isConnected should be optimized.
17 - http://www.boost.org/development/requirements.html#Design_and_Programming
18 - Would it be a good idea to cache second-order neighborhoods (delta's) in BipGraph?
19 - Would it be a good idea to add the variable label -> index hashmap in FactorGraph,
20 to replace the linear searches that are performed every time for findVar()?
21 No, a better idea is to avoid calls to findVar() as much as possible.
22 - Can the FactorGraph constructors be optimized further?
24 - Add iterations (like maxdiff, but counts iterations) to some algorithms
25 - A DAIAlg<T> should not inherit from a FactorGraph/RegionGraph, but should store a
29 - Test Visual C++ compatibility
30 - Figure out which libraries are required and document in README
31 boost headers, boost::program_options library, boost::graph library,
32 boost::math library (under Windows)
33 - Change email address
35 FILES IN SVN HEAD THAT ARE NO LONGER RELEVANT FOR GIT MASTER:
70 FILES IN SVN HEAD THAT ARE STILL RELEVANT:
96 - bipgraph.h, bipgraph.cpp