- Jan 03, 2017
-
-
Christophe Geuzaine authored
-
- Jan 02, 2017
-
-
Christophe Geuzaine authored
-
Christophe Geuzaine authored
-
Christophe Geuzaine authored
-
- Dec 30, 2016
-
-
Christophe Geuzaine authored
-
- Dec 23, 2016
-
-
Christophe Geuzaine authored
-
- Dec 22, 2016
-
-
Van Dung Nguyen authored
-
Christophe Geuzaine authored
-
PA Beaufort authored
-
- Dec 21, 2016
-
-
PA Beaufort authored
crossField :-)
-
- Dec 20, 2016
-
-
Christophe Geuzaine authored
-
- Dec 19, 2016
-
-
Nicolas Marsic authored
1/ allow to select version for python wrappers in normal mode 2/ install Numeric/pointsGenerators.h for small_fem
-
- Dec 16, 2016
-
-
Christophe Geuzaine authored
re-index mesh vertices before removing duplicates: this allows to cleanup meshes that have nodes with identical ids ("getNum()")
-
Christophe Geuzaine authored
No commit message
-
- Dec 15, 2016
-
-
Christophe Geuzaine authored
-
- Dec 14, 2016
-
-
Christophe Geuzaine authored
-
Christophe Geuzaine authored
-
Christophe Geuzaine authored
No commit message
-
Christophe Geuzaine authored
-
- Dec 13, 2016
-
-
Christophe Geuzaine authored
by default, disable tooltip when hovering over views: this seems to pose problems on some Linux machines (cf. Jon)
-
- Dec 12, 2016
-
-
Van Dung Nguyen authored
-
- Dec 11, 2016
-
-
Gauthier Becker authored
Fix PETSc deprecated warnings (since PETSc 3.6 / 3.7) Fix BCs containers and their groupOfElement destruction --> need c++11 (cm3) Update CMakeLists (cm3) to support c++11 Fix cm3 tests, and remove import scipy as unused (+ python3 support) Fix DLOPEN warning for msch project
-
Christophe Geuzaine authored
-
Christophe Geuzaine authored
-
Kilian Verhetsel authored
This allows parts of the graph that do not belong to the fragment to not be iterated over when optimizing said fragment.
-
Kilian Verhetsel authored
The original code would only record vertices that were reached in two different ways (and thus the edge was already marked as black when visited a second time).
-
Kilian Verhetsel authored
Nodes should be rejected based on the existence of an edge, not based on whether that edge has already been visited or not.
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
value to a clique
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
iterating over them An updatable priority queue is required to change the keys of elements if the priority queue when making decisions or backtracking, hence why std::priority_queue was not appropriate.
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
A monotonic clock (e.g. clock_gettime(2), GetTickCount64) would be more appropriate.
-
Kilian Verhetsel authored
-
Kilian Verhetsel authored
-