Key points are not available for this paper at this time.
Abstract—This note discusses possible advantages to be gained through use of associative memory in finding the shortest path through a large graph having edges of unequal lengths. An algorithm is described which exploits associative memory's highly parallel search and arithmetic capabilities and which is economical in storage requirements.
Bob Crane (Mon,) studied this question.