Care was taken for example to avoid list operations that affect the size of a list, like appending. Instead, fields of constant lengths and indices are used.
For all algorithms the dependance of the calculation time on the size of the problem was investigated and is shown in plots in the reference manual of the package. By means of this information, users can estimate in advance how long their own problems will be processed and what problem sizes can be calculated in practice with a specific algorithm.
Some available implementations and typical calclation times in seconds of the comfortable interface for complete graphs with 50 and 200 vertices (40,000 edges) are sumarized in the next table. The timings include all automatic consistency checks and were obtained on a computer with a Pentium 4 running at 1.6 GHz with 800 MHz Rambus memory.
|Minimum Spanning Tree||0.453||5.437|
|Minimum Cost Flow||0.719||30.734|
The table below shows the dependance on the vertex count of the algorithm of Dijkstra to get the shortest paths in a graph without negative weighted edges.
|Vertices||Calculation Time [s]|