Figure 12: A three-dimensional animation of a shortest-path algorithm showing computed distances and paths from a particular node (marked with circles). The algorithm is operating on the depicted planar graph. Currently-known paths and distances are shown by the lines and spheres above the graph. Colours represent the status of a node in the computation, either scanned (green) or unscanned (red). This visualization attempts to capture the program invariant, "The currently-computed distance of a node is the length of the shortest path all of whose internal nodes are scanned."

---

B.A.Price@open.ac.uk / 19 July 94