The \(\mathcal {C}\) -Orientation problem asks whether it is possible to orient an undirected graph to a directed phylogenetic network of a desired network class \(\mathcal {C}\) . This problem arises, for example, when visualising evolutionary data, as popular methods such as Neighbor-Net are distance-based and inevitably produce undirected graphs. The complexity of \(\mathcal {C}\) -Orientation remains open for many classes \(\mathcal {C}\) , including binary tree-child networks, and practical methods are still lacking. In this paper, we propose (1) an exact FPT algorithm for \(\mathcal {C}\) -Orientation, applicable to any class \(\mathcal {C}\) admitting a tractable membership test, and parameterised by the reticulation number and the maximum size of minimal basic cycles, and (2) a very fast heuristic for Tree-Child Orientation. While the state-of-the-art for \(\mathcal {C}\) -Orientation is a simple exponential time algorithm whose computational bottleneck lies in searching for appropriate reticulation vertex placements, our methods significantly reduce this search space. Experiments show that, although our FPT algorithm is still exponential, it significantly outperforms the existing method. The heuristic runs even faster but with increasing false negatives as the reticulation number grows. Given this trade-off, we also discuss theoretical directions for improvement and biological applicability of the heuristic approach.
