Tree: 35d16a1191

Commit Graph

9 Commits (35d16a11916865bfd4b390c0680d1e0a300d1114)

Author	SHA1	Message	Date
dehnert	35d16a1191	Replaced VectorSet bei boost::container::flat_set, which does essentially the same. Fixed a bug in sparse matrix creation. Former-commit-id: cb632bcfd4	12 years ago
dehnert	cf2b84b281	Further work on iterators for sparse matrix. Former-commit-id: 8e78262161	12 years ago
dehnert	a26f63be30	Finished reworking the sparse matrix implementation. Adapted all other classes to the (partially) new API of the matrix. Former-commit-id: 2c3b5a5bc3	12 years ago
masawei	170306e46d	Moved SparseMatrix transposition function from AbstractModel (named: getBackwardsTransitions) to SparseMatrix (named: transpose) where it belongs. - Fixed one problem marked FIXME in the transpose function. The need for a "sentinel" element was created by an off by one in the prior loop. - Changed all occurences of SparseMatrix<bool> to SparseMatrix<T>. Now the only two types for which SparseMatrix is instantiated are double and int. - Compiles again. |-> Compile time seems to be roughly the same for clean; make all. For incremental builds I haven't tested yet. Former-commit-id: 6d829e0903	12 years ago
dehnert	a33717787c	Bugfixes for new set class. Former-commit-id: 10d9632922	12 years ago
dehnert	422da8f481	Added set class with an underlying vector container. Adapted code in counterexample generators to use the new set class. Still bugs in it though. Former-commit-id: ac9993eab2	12 years ago
dehnert	58fa1a46a0	Added some comments. Former-commit-id: acb1c62506	12 years ago
dehnert	b18199d3ec	Further work on minimal label set generators. Former-commit-id: 84e86f5842	12 years ago
dehnert	a2bba28f94	Moved static analysis for guaranteed label set computation into utilities and improved MILP-based approach by using this information. Former-commit-id: 611867288a	12 years ago