Dijkstra's algorithm finds the shortest path for a given problem. Dijkstra's algorithm can be used to find the shortest route between two cities. This algorithm is so powerful that it not only finds the shortest path from a chosen source to a given destination, it also finds all of the shortest paths from the...

This engineering activity, suitable for children in computing lessons, looks at the basics of flowchart construction. Simple examples, such as the decisions made by a dog chasing a stick, are used to make flowchart representation of algorithms accessible to younger children. A simple design activity requires...