2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31668We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus. The algorithm performs a probabilistic best-first expansion of a set of navigation trees to find relevant and compact trails. We describe the implementation of the algorithm, scoring methods for trails, filtering algorithms and a new metric called \emph{potential gain} which measures the potential of a page for future navigation opportunities.11 pages, 11 figuresData Structures and AlgorithmsInformation RetrievalH.3.3;H.5.4;G.2.2;F.2.2text