Path Detection in Multidimensional Iterative Arrays

1 April 1967

journal article
Published by Association for Computing Machinery (ACM) in Journal of the ACM

Vol. 14 (2) , 300-310
https://doi.org/10.1145/321386.321392

Abstract

An iterative array is defined as an infinite set of identical blocks, interconnected in a regular manner. Each block has inputs and outputs, with internal connections from certain inputs to certain outputs. This paper is concerned with the problem of determining, for a given structure internal to each block, the existence of a given path. The path is specified by the relative positions in the array of its endpoints, and the algorithm presented decides whether such a path is possible in the given array. A special case of the general procedure, which tests for a closed path, has been successfully programmed.

Keywords

PATH DETECTION
GENERAL PROCEDURE
SPECIAL CASE
IDENTICAL BLOCK
CERTAIN INPUT
ITERATIVE ARRAY
RELATIVE POSITION
INTERNAL CONNECTION
CLOSED PATH
MULTIDIMENSIONAL ITERATIVE ARRAYS
REGULAR MANNER
CERTAIN OUTPUT

This publication has 1 reference indexed in Scilit:

A Computer Oriented toward Spatial Problems
Proceedings of the IRE, 1958