Uses the Viterbi path dynamic programming algorithm to compute the optimal cluster assigments Takes in LLE_node_vals matrix and computes the path that minimizes the total cost over the path Note the LLE's are negative of the true LLE's actually!!!!! Note: switch penalty > 0
(LLE_node_vals,switch_penalty = 1)
source not stored for this graph (policy: none)