Make your Path

PLAY & OPTIMIZE

In mathematics, a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called nodes, and the links that connect some pairs of nodes are called edges. This is what we also know as a "network".

There are 2 challenges within networks that caught our attention: 

Click on the image to start the model

Being able to draw it. Yes, anyone can draw some circles and lines, but the challenge is drawing them in a way that can be understood. In this model we use an adapted Kamada-Kawai algorithm that represents the graph with a physical model in order to organize and redistribute nodes. Each edge works like a spring and each node works as a charged particle. Newton's Law takes care of the rest. The user (YOU) will be able to interact with the model in order to obtain the desired layout for the graph.

Find the optimal path within any 2 nodes. In this model we use an adapted Dijkstra algorithm to obtain the best path. The user will interact with the model by trying to find the optimal path in a click-by-click approach. We are so proud of the algorithm that we defy you to find a better route. 

That's all! Just click the image to try the model and hope you enjoy!