For a directed graph representation, each graph vertex is identified by a polytope configuration symbol and each directed graph edge can be annotated by the generic symmetry operation that transforms its head configuration to the designated tail configuration. An example is shown in Fig. . Here, the 0D region 𝐜 𝑖 exhibits PG3a symmetry and is represented by the blue triangle. Three out-edges, also coloured blue, are each annotated by generic symmetries 𝑠 𝑖,1 , 𝑠 𝑖,2 , and 𝑠 𝑖,3 . Each of these symmetries are Mulliken symbols within the character table for PG3a. A 1D region is shown as a red square 𝐜 𝑗 and exhibits PG2a symmetry. Transformations of 𝑠 𝑗,1 symmetry move the configuration within the 1D region (shown as the self-loop) and out of this region to its 0D endpoints in blue (only one is shown here). A transformation of different symmetry 𝑠 𝑗,2 moves these configurations to its adjacent green region. Symmetry demands that the single 𝑠 𝑗,2 annotated out edge be balanced by another 𝑠 𝑗,2 edge on the "other side"not shown in this figure. Both 𝑠 𝑗,1 and 𝑠 𝑗,2 are Mulliken symbols with the character table for "PG2a". Fig. shows a specific example from the AB4 T-4 E-mode configuration space .