“…The directed graph G = (V, E) that corresponds to this example has vertex and edge sets V = {1, 2, 3, 4, 5, 6} and E = {(1, 2), (1, 3), (2, 3), (2,5), (3,2), (3,5), (4, 2), (4, 5), (5, 2), (5, 3), (6,5), (6, 3)}. Figure 7 shows the desired formation depicted as a directed graph, where each vehicle has 2 neighbors with a desired distance of 1 from each neighbor.…”