Fig. 1

An example instance of SoFaCLaP showing the layered graph and the capacities of all layers (left) and—assuming that there is a cable type with sufficient capacity—a feasible cable layout (right). The flow values on the edges are omitted in this visualization. They are, however, uniquely determined, since the cable layout is cycle-free, and can be computed by counting the strings in the respective subtrees of the layout