Problem of path connections in graphs

A generalization is considered of a problem that arises in the design of electronic equipment – the tracing of printed circuits. The generalization is proved to be $NP$-complete in the sense sused by Cook and Karp.