7.2.4. Other Graph Search Functions
 (lsh/libgraph/rsearch.lsh)


algorithms for searching a graph. the difference with the g-viterbi and g-forward is that the seqrch is carried from the initial (upper) nodes. besides, a startnode must be specified.

7.2.4.0. (r-viterbi graph startnode)
 (lsh/libgraph/rsearch.lsh)


Applies viterbi algorithm to compute a graph whose single path is a copy of the best path of graph graph . Graph graph should not have cycles. different from g-viterbi in 2 respects - reverse order - a startnode can be specified

7.2.4.1. (r-forward graph startnode)
 (lsh/libgraph/rsearch.lsh)


Returns the lor-added costs of all paths in lattice graph . different from g-forward in 2 respects - reverse order - a startnode can be specified

REMARK: The graph should not have cycles.


7.2.4.2. (r-restrict-to-meanings graph meanings startnode)
 (lsh/libgraph/rsearch.lsh)


Creates a new graph which implements the subset of paths of graph graph whose links with non null meanings implement the meanings given in the integer matrix meaning . The links of the new graph have the same cost, label and meaning than the original links. The data field points to the original link.

(This code is derived from g-compose )