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

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

Returns the lor-added costs of all paths in lattice

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

(This code is derived from **g-compose **)