public List < ViterbiNode > search ( ViterbiLattice lattice ) { ViterbiNode [ ] [ ] endIndexArr = calculatePathCosts ( lattice ) ; LinkedList < ViterbiNode > result = backtrackBestPath ( endIndexArr [ 0 ] [ 0 ] ) ; return result ; }
Find best path from input lattice .