Skip to main content
. 2013 Jul 29;110(34):13717–13722. doi: 10.1073/pnas.1301111110

Table 1.

A comparison between average cost as well as path length obtained by our algorithm (P) and the Dijkstra algorithm (D)

Inline graphic
 Inline graphic
Inline graphic Inline graphic Inline graphic Inline graphic
London subway network Inline graphic Inline graphic Inline graphic Inline graphic
Global airport network Inline graphic Inline graphic Inline graphic Inline graphic

The average cost is given by Inline graphic and path length by Inline graphic. Results are averaged over sets of source–destination pairs recorded in each 1-min interval between 8:30 AM and 9:00 AM on one Wednesday in November 2009 for the London subway network and five sets of 300 randomly drawn source–destination pairs for the global airport network. The values after the Inline graphic signs indicate the corresponding SE.