Related Experiment Video
Updated: Jun 9, 2025

A Method for Growing Bio-memristors from Slime Mold
Published on: November 2, 2017
Scalable Method to Find the Shortest Path in a Graph with Circuits of Memristors
Alice Mizrahi1,2, Thomas Marsh1, Brian Hoskins1
1National Institute of Standards and Technology, Gaithersburg, Maryland, USA.
Abstract:
Finding the shortest path in a graph has applications in a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest-path problem using circuits of nanodevices called memristors and validate it on graphs of different sizes and topologies. It is both valid for an experimentally derived memristor model and robust to device variability. The time and energy of the computation scale with the length of the shortest path rather than with the size of the graph, making this method particularly attractive for solving large graphs with small path lengths.
Related Concept Videos
Circuit Terminology
A circuit, on the other hand, is also an interconnected system of electrical elements but must contain one or more closed paths.
Neural Circuits
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...
Network Function of a Circuit
Mesh Analysis
A fundamental concept in mesh analysis is the definition of meshes and mesh currents. A mesh is a closed...
First-Order Circuits
One common example of a first-order circuit is the RC (resistor-capacitor) circuit. These circuits are used in relaxation oscillators such as neon lamp oscillator circuits. When voltage is...
Current Growth And Decay In RL Circuits

