P. polycephalum Can Compute Shortest Paths

Abstract

We demonstrate that a simple model of P. polycephalum can be used to compute shortest paths between two points in a graph. Reminiscent of how the real organism behaves in a maze when presented with two distinct food sources s and t, the algorithm gradually identifies the shortest s-t path by retreating from everywhere else in the graph.