shortestPaths
fun <T> shortestPaths(fst: FST<T>, fromNode: FST.Arc<T>, startOutput: T, comparator: Comparator<T>, topN: Int, allowEmptyString: Boolean): Util.TopResults<T>
Starting from node, find the top N min cost completions to a final node.