The degopt form has a natural topological order that makes the memory footprint smaller in comparison to the get_topo_order-function, by working row-by-row in how we usually write it. I suggest we implement

get_topo_order_degopt(k)

which returns a Vector{Symbol} corresponding to that topological order for a degopt graph with k multiplications. We may want to extract the order with a call to get_degopt_coeffs (in order to lessen the place the symbols are hardcoded).