This shows how the Dijkstra algorithm works. This algorithm is used to compute the shortest paths between location. As example we use the streets of the Dutch town of Brielle. Used here.
This shows how the Dijkstra algorithm works, on a very simple graph. The each step of the algorithm is shown. (Not used in article)
Created according to the Configuration model. with the parameters given by the user. For a conference I extended this animation to also show a random walk on the resulting graph. Once the walker is shown, the color of the nodes indicates the local time. Aim=Show mixing of random walk. Link. Used in articles.