Currently non-incremental layout of fcose calls incremental layout of the cose algorithm, which doesn't reduce trees, and hence takes longer. There is not much of a reason not to reduce the trees during non-incremental layout of fcose though. So, if we can implement a non-exposed flag named to cose (cose-bilkent) to force tree reduction (even during incremental cose) and set it to true for non-incremental cose, that'd be great.
Currently non-incremental layout of fcose calls incremental layout of the cose algorithm, which doesn't reduce trees, and hence takes longer. There is not much of a reason not to reduce the trees during non-incremental layout of fcose though. So, if we can implement a non-exposed flag named to cose (cose-bilkent) to force tree reduction (even during incremental cose) and set it to true for non-incremental cose, that'd be great.