Differences between revisions 3 and 5 (spanning 2 versions)

Results for Exercise Sheet 2 (Dijkstra results)

Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm in seconds (_precision: two digits after the fraction point_), number of nodes settled, and cost of the shortest (path _in seconds_). If possible, provide the figures for columns 2 - 6 for both Saarland and BaWü (separately). Last two columns as usual, see the result table for Exercise Sheet 1.

Name	#nodes LCC	#arcs LCC	av. query time	av. #settled nodes	av. SP cost	Processor / RAM	Language
Example	1,111,111 / 11,111,111	1,111,111 / 11,111,111	1.11 / 11.11	111,111 / 1,111,111	11,1111 / 111,111	Intel X5560 @ 2.8Ghz / 96 GB	C++

-  ⇤ ← Revision 3 as of 2012-05-04 17:59:05 → 
  Size: 976
  Editor: Hannah Bast
  Comment:
+   ← Revision 5 as of 2012-05-04 18:01:47 → ⇥
  Size: 981
  Editor: Hannah Bast
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 3:
-= Results for Exercise Sheet 1 (OSM file -> graph) =
+= Results for Exercise Sheet 2 (Dijkstra results) =
 Line 5:
-Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm in seconds (precision: two digits after the fraction point), number of nodes settled, and cost of the shortest path in seconds. If possible, provide the figures for columns 2 - 6 for both Saarland and !BaWü (separately). Last two columns as usual, see the [[EfficientRoutePlanningSS2012/ReadOsmResults|result table for Exercise Sheet 1]].
+Add your row to the table below, following the examples already there. LCC refers to the largest connected components. In columns 4 - 6 enter the averages (= total / number of queries) for the execution time of Dijkstra's algorithm in seconds (_precision: two digits after the fraction point_), number of nodes settled, and cost of the shortest (path _in seconds_). If possible, provide the figures for columns 2 - 6 for both Saarland and !BaWü (separately). Last two columns as usual, see the [[EfficientRoutePlanningSS2012/ReadOsmResults|result table for Exercise Sheet 1]].