1. An intersection of arcs in a graph that is not a planar graph. Where the arcs represent linear code sequences in a program, and the nodes represent branch points in the program, then the presence and frequency of knots is a measure of the complexity of the program (see control-flow graph).