A more general algorithm for computing closed semiring costs between vertices of a directed graph
This note describes a generalization of an algorithm given by Aho, Hopcroft, and Ullman [1], originally derived from the work of Kleene [2] and McNaughton and Yamada [3].…