Google Code In

Tasks to choose from:

• Wikipedia example
  • Task 1
  • Task 2
• Hanoslav example
  • Task 3
  • Task 4
• Boost:graph example
  • Task 5
  • Task 6
  • Task 7

Wikipedia example

Task 1

The example of Dijkstra Algorithm on wikipedia can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/wiki_demo.sql

The task is to create a page for the pgRouting workshop that includes the graph, the code, link to wikipedia and the license.

Task 2

The example of Dijkstra Algorithm on wikipedia can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/wiki_demo.sql

The task is to add the results and a brief explanation of the results to the page created on Task 1

Hanoslav example

Task 3

The example of Dijkstra Algorithm on hanoslav.net can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/hanoslav_demo.sql

The task is to create a page for the pgRouting workshop that includes the graph, the code, link to Hanoslav.net and the license.

Task 4

The example of Dijkstra Algorithm on hanoslav.net can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/hanoslav_demo.sql

The task is to add the results and a brief explanation of the results to the page created on Task 3.

Boost:graph example

Task 5

The example of Dijkstra Algorithm on Boost:graph can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/boost_demo.sql

The task is to create an image of the graph that represents the graph on the code.

Task 6

The example of Dijkstra Algorithm on Boost:graph can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/boost_demo.sql

The task is to create a page for the pgRouting workshop that includes the graph created on Task 5, the code, link to Boost:graph and the license.

Task 7

The example of Dijkstra Algorithm on Boost:graph can be solved using the following code:

https://github.com/pgRouting/pgrouting/blob/master/src/dijkstra/demo/boost_demo.sql

The task is to add the results and a brief explanation of the results to the page created on Task 6

References:

• Sphinx adding code documentation.
• Sphinx adding images documentation.
• Example Sphinx page:
  • This "documentation code": https://raw.githubusercontent.com/pgRouting/workshop/master/docs/source/chapters/shortest_path.rst
  • Generates this page: http://workshop.pgrouting.org/2.4.11/en/chapters/shortest_path.html