I have have a digraph with three nodes (A, B, and C) each of which contains an array. A=[1,2,3], B=[4,5,6], and C=[7,8,9]. There are two edges A-B and B-C. When you transverse the graph you construct the array [1,2,3,4,5,6,7,8,9].
Problem: I need the ability to set the first value in C to appear between the first and second elements in the array of B (i.e. [1,2,3,4,7,5,6,8,9]). However, if an edge bypasses node B, the first element of C would not mix with A (i.e. [1,2,3,7,8,9] not [1,7,2,3,8,9]).
How would I express this characteristic using an incidence list?