I've just copied the code I had for the "longest path" ranking algorithm for non-compound graphs (basic Sugiyama). Not bad for a first approximation, but I still need to separate top/bottom border and base nodes into separate ranks and apply "minimum length" and "weight" constraints.