Because the global maximum probability is determined by each local maximal probability, for a path of N symbols, we only need to store the information of the current node.
we need only store M probability values in order to find the maximal probability value.