1. A graph-search network assembled from cellular automata, comprising: a graph-search network configured from appropriately intercoupled D-node cellular automata arranged to be isomorphic to a preselected graph structure; said D-node cellular automata being configured from cellular automata that are an excitory E-Cell and inhibitory I-Cell; said delta D-node receiving inputs, x.sub.0 and x.sub.1, and providing an output, y.sub.0 ; said D-node being assembled from an inhibitory I-Cell, I.sub.0, and three excitory E-Cells, E.sub.0, E.sub.1, and E.sub.2 ; and said D-Node being configured such that (a) x.sub.0 is applied to I.sub.0 and to two inputs of E.sub.0, (b) x.sub.1 is applied to I.sub.0 and to two inputs of E.sub.1, (c) E.sub.0 and E.sub.1 also receive as inputs the output of I.sub.0, (d) a fourth input to each of E.sub.0 and E.sub.1 is the fed back output y.sub.0, (e) the outputs of E.sub.0 and E.sub.1 provide the inputs to E.sub.2, and (f) the output of E.sub.2 provides the D-Node output y.sub.0 ; said E-Cell receives a plurality of inputs, x.sub.n, each with an input value of -1, 0, or +1 and provides a single output, y.sub.0, with an output value of 0, or -1 that is determined in accordance with the following state vector and input functional relationships: ##EQU5## said I-Cell receives a plurality of inputs, x.sub.n, each with an input value of -1, 0, or +1 and provides a single output, y.sub.0, with an output value of 0, or +1 that is determined in accordance with the following state vector and input functional relationships: ##EQU6## where V.sub.EC and V.sub.IC are cell state vectors.