diff options
| author | bjorn <bjorn@bringert.net> | 2008-11-27 10:29:29 +0000 |
|---|---|---|
| committer | bjorn <bjorn@bringert.net> | 2008-11-27 10:29:29 +0000 |
| commit | 1145aefdbb37667ff05488314a26b3d2eefa0c8b (patch) | |
| tree | 7c7a9abfacd2ab4d1d9f5186fed15fdaec755633 /examples | |
| parent | a4e731cc33c3a8ccb6cdb1929f6b515720a1525e (diff) | |
More efficient implementation of topological sort.
Profiling the compilation of the OALD lexicon showed that 90-95% of the time was spent in topoSort. The old implementation was quadratic. Replaced this with O(E + V) implementation, in GF.Data.Relation. This gave a 10x speed-up (~ 25 sec instead of ~270 sec) for compiling ParseEng and OaldEng.
Diffstat (limited to 'examples')
0 files changed, 0 insertions, 0 deletions