Differences between revisions 1 and 10 (spanning 9 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, with exactly two digits after the fraction point), number of nodes settled, and cost of the shortest path (in minutes + 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.11s / 11.11s	111,111 / 1,111,111	11m01s / 111m11s	Intel X5560 @ 2.8Ghz / 96 GB	C++
SE KF	213,567 / 2,458,230	225,506 / 2,613,338	0.03s / 0.54s	111,639 / 1,210,910	28m46s / 88m15s	Intel P8600 @ 2.4Ghz / 4 GB	C++

-  ⇤ ← Revision 1 as of 2012-05-04 17:57:50 → 
  Size: 942
  Editor: Hannah Bast
  Comment:
+   ← Revision 10 as of 2012-05-04 23:22:03 → ⇥
  Size: 1149
  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, with exactly two digits after the fraction point__), number of nodes settled, and cost of the shortest path (__in minutes + 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]].
 Line 8:
-||'''Name''' ||'''#nodes LCC''' ||'''#arcs LCC''' ||'''av. query time'''||'''av. #settled'''||'''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|| || C++||
+||'''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.11s / 11.11s || 111,111 / 1,111,111|| 11m01s / 111m11s ||Intel X5560 @ 2.8Ghz / 96 GB || C++||
|| SE KF ||213,567 / 2,458,230 ||225,506 / 2,613,338||0.03s / 0.54s || 111,639 / 1,210,910|| 28m46s / 88m15s ||Intel P8600 @ 2.4Ghz / 4 GB || C++||