- 09 Nov, 2017 40 commits
-
-
-
-
-
-
-
If group has size 4 and graph contains one of following subgraphs, it cannot be group-connected: - vertex with all neighbours of degree 2 - vertex such that 2 of 3 his neighbours has degree 2 and so do their neighbours - edge such that all 4 of her neighbours have degree 2
-
Producer & workers now wait for consumer so they don't flood him with data.
-
-
Exposes another parameter for fine tuning parmap.
-
No measurable difference on my laptop :-(
-
-
-
-
-
-
-
-
-
-
-
-
Also fixes related typos
-
Add REQUIRE to define dependencies among compile time options. Also defines new options USE_TWO_CUTS and EXPLICIT_NORMAL_EDGES which are unused by now.
-
-
-
-
-
The new way avoids using modulo operation and is nicer to optimized Mapping structures.
-
-
-
-
-
Optimized versions are off by default
-
-
We split definition of Mapping into separate file. We also change Mapping from std::vector<*> into class wrapping std::vector<*>. This is prerequisite for future specialized fast implementation of Mapping for Z4 and Z2_2.
-
-
Change default value of parallel from 1 to 0, so we can use parmap with parallel = 1 to measure slowdown caused by interprocess communication.
-
-
Add aditional parameter to Tester::init method. Unused now but will be utilized by future 2-cut optimalization. Also required a bit of refactoring.
-
-
