An experimental LPSolverWrapper class which uses glpk. For a short
demo, max flow problems are solved with it. This demo does not
demonstrates, but the main aims of this class are row and column
generation capabilities, i.e. to be a core for easily
implementable branch-and-cut a column generetion algorithms.
2 UnionFind<graph_type, NodeIt> uf( G, G.NodeIt());
3 NodeUnionFind<graph_type> uf( G);
6 find visszaadja a nagyfonokot, altalaban kell e a belso tarolobol tudni visszafejteni az ott levo pontot.
8 esetleg merge(Nodeit fonoka, NodeIt fonokb)
11 find: visszaad egy egészet
13 findAndMerge: visszaad egy boolt