Schülerlabor Informatik - InfoSphere, Informatik entdecken in Modulen für alle Schulformen & Klassenstufen
1 of 3

Searching for the Shortest Path - Hands-on Experience in Graph Algorithms

In this module, the students shall find a solution to the problem of finding the shortest paths in a road network. This problem is omnipresent e.g. when going to school or work or even shopping. The most common tool for route planning is a navigation system. But how does it find the shortest paths? At the start of the module, the students are asked to find the shortest paths in the animation 'Shortest Path'. Afterwards, while playing a logistics company simulation game, the students should little by little create their own algorithm to find the shortest paths and develop a graph structure. The next step is to implement this algorithm in pseudocode. In this module, the students will work out the theoretical background of the concept 'Shortest Path'.

Educational Stage
Junior High School
Required Knowledge
fundamentals of algorithmic thinking
4,0 hours (incl. breaks)
Created by
Artur Nowak, Manuel Froitzheim