diff options
| author | Pierre-Marie Pédrot | 2014-05-12 20:26:39 +0200 |
|---|---|---|
| committer | Pierre-Marie Pédrot | 2014-05-13 12:09:42 +0200 |
| commit | 2a474ea84c96a9b68f72f20b88f7f5e6fbe0c254 (patch) | |
| tree | 7aeb89bf065b824a3da791e9e728a25de6970852 /dev/base_include | |
| parent | 9c7e0a2e6a8e46dc439603cde501037a3e18050a (diff) | |
Rewritten the sorting algorithm for universes with a better complexity.
This should be now linear instead of the cubic Bellman-Ford algorithm.
The new algorithm assumes that the universe graph is a DAG if we remove
the {Le, Eq}-cycles, which is the case when the graph is consistent.
Luckily we only use the sorting algorithm on such consistent graphs,
in the Print Sorted Universes command.
Diffstat (limited to 'dev/base_include')
0 files changed, 0 insertions, 0 deletions