2 Commits

Author	SHA1	Message	Date
bjorn	f6cf10e655	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.	2008-11-27 10:29:29 +00:00
bjorn	210089b6c8	Move Graph, Relation and Graphviz modules from GF.Speech to GF.Data.	2008-11-27 08:43:08 +00:00