We propose an electrical circuit analogue of adaptive transport networks in true slime mold. Prom systematic simulations of this circuit, it is numerically confirmed that shortest path finding task is accomplished adaptively; (i) the shortest path is always identified even for large random networks (number of nodes ～2{sup}10), (ii) if there are multiple, competing shortest paths in the network, they are simultaneously identified, and (iii) for temporal changes in the network topology, new shortest paths are quickly identified accordingly. Required times for identifying the shortest path are also systematically investigated with respect to size of the networks.
展开▼
