sp
/
tempest
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
1400 Commits
2 Branches
0 Tags
187 MiB
Tree: 11696fc468
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '11696fc468'
${ noResults }
Commit Graph

15 Commits (11696fc468ad868988613665558d3872977f79e4)

Author SHA1 Message Date
dehnert 2c231a794d SCC decomposition now correctly ignores zero-entries in the matrix.
11 years ago
dehnert d40573640f Dropped our current Tarjan-implementation in favour of the path-based algorithm by Gabow (and others) as this seems to perform a lot better (at when comparing our implementations).
11 years ago
dehnert db232fe39b Moved from pair to MatrixEntry as the basic building block of the matrix. Now matrix elements can be accessed in a more readable way.
11 years ago
sjunges 72c804815e several *small* fixes and better direct encoding
11 years ago
dehnert f79329bd9d Fixed SCC decomposition. Added functional tests for SCC decomposition.
12 years ago
dehnert f32853b6aa Beautified remaining storage classes a bit.
12 years ago
dehnert cf2b84b281 Further work on iterators for sparse matrix.
12 years ago
dehnert a26f63be30 Finished reworking the sparse matrix implementation. Adapted all other classes to the (partially) new API of the matrix.
12 years ago
dehnert 07fbff7a07 Started refactoring bit vector class.
12 years ago
dehnert 101c39f365 Added correct detection of states that possess infinite exptected time to reach a given goal set.
12 years ago
dehnert b9130180ee Rough sketch of MEC decomposition.
12 years ago
dehnert f287b7e760 Further steps towards implementation of MEC decomposition.
12 years ago
dehnert 09f192b40f Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata.
12 years ago