Intuitively, it is clear what we mean when we say that a graph is a "line of vertices" (see below). Give a set-theoretic definition of a line of vertices, and show that if a directed network is not a line of vertices, then its underlying graph must have an undirected cycle.