Shortest network path calculation

Interactive version (currently Chrome or Safari only)

A basic algorithm to calculate the shortest path through random networks between 2 nodes (without passing the same node twice). Networks with a higher ratio of connections to nodes (especially where connections cross each other) contain exponentially more possible paths.

The algorithm uses a recursive nested logical process (see the Processing code) to compare all possible path options.