Media create for the networkpages.nl

The following is a list of animation written for the network pages. It is created with the intended that they can also be used within educational and scientific context, by each member of the network projected as well as anyone else.

Algorithms

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)

Advanced traffic flow animation
Animation of the flow on a network, this includes advanced methodes to read the flow and network data from input files. link.

Queueing systems

To be used in future articles.
Not used in an article.
Not used in an article. Warning, very early programming style.

Erdös-Rényi Graph

The creation of an Erdös-Rényi Graph with the parameters given by the user.

Configuration model

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.

Inhomogeneous random graph

Preferential Attachment

Competition

Vaccination

Not used in an article. Please write an article about head immunity.

Ideal gas particle system