c 9th DIMACS Implementation Challenge: Shortest Paths c http://www.dis.uniroma1.it/~challenge9 c Sample point-to-point problem query performance report file c c problem and solver name line (first non-comment line): p res sp p2p q mysolver c ---------------------------------------------------------------- c c performance figures below refer to graph sample.0.gr and problem sample.0.p2p: f sample.0.gr sample.0.p2p c c the graph has 1024 nodes, 4096 arcs, and arc weights in [0,1024]: g 1024 4094 0 1024 c c the average time per p2p query on sample.0.gr is 12.71 msec: t 12.71 c c the solver uses 724 KB on this instance: s 724 c c the solver performed avg 322.20 node scans per p2p query on this instance: v 322.20 c c the solver performed avg 441.34 arc scans per p2p query on this instance: e 441.34 c c the solver performed avg 390.14 distance improvements per p2p query on this instance: i 390.14 c additional user-defined lines: number of "blue" and "red" paths scanned u myaddress@mydomain.org blue-paths 22714 u myaddress@mydomain.org red-paths 2714 c c ---------------------------------------------------------------- c c performance figures below refer to graph sample.1.gr and problem sample.1.p2p: f sample.1.gr sample.1.p2p c c the graph has 2048 nodes, 8192 arcs, and arc weights in [0,1024]: g 2048 8192 0 1024 c c the average time per p2p query on sample.1.gr is 25.42 msec: t 25.42 c c the solver uses 1449 KB on this instance: s 1449 c c the solver performed avg 633.32 node scans per p2p query on this instance: v 633.32 c c the solver performed avg 1102.91 arc scans per p2p query on this instance: e 1102.91 c c the solver performed avg 971.51 distance improvements per p2p query on this instance: i 971.51 c additional user-defined lines: number of "blue" and "red" paths scanned u myaddress@mydomain.org blue-paths 44714 u myaddress@mydomain.org red-paths 3714