Figure 1
From: Decoding HMMs using the k best paths: algorithms and applications
Example of compressed tree. Solid nodes and lines indicate the actual data structure. The dotted nodes and lines indicate intermediate steps in the construction described in the text.