A year later, he came across another problem from hardware engineers working on the institute's next computer: minimize the amount of wire needed to connect the pins on the back panel of the machine. As a solution, he rediscovered the algorithm known as Prim's minimal spanning tree algorithm. The Prim's algorithm was originally developed in 1930 by Czech mathematician Vojtěch Jarník. and later independently rediscovered and republished by Robert C. Prim in 1957, and Dijkstra in 1959. Therefore, it is also sometimes called the DJP algorithm.