Easing the conscience of the guilty net

This article deals with dynamical system neural networks which find for given vertices simple paths joining the vertices with optimal (shortest) or near-optimal length. Such neural networks might have a role in scheduling a machine which wires integrated circuits. The authors develop a modified guilty net algorithm which is fully parallel in vertex placement; thus there might be efficient, albeit not perfect, implementations in parallel. During iterations of the algorithm all vertices of a mathematical path move in two-dimensional space until vertex positions coincide with given physical vertices.