Considering the aforementioned issues, we implement an approximate solution to trade off between the efficiency of implementation and the informativeness of the graph.
we reorder evidence sentences with a topology sort algorithm with the intuition that closely linked nodes should exist in neighboring sentences.