7.2.2. Searching and Pruning Graphs |
(lsh/libgraph/gsearch.lsh) |

searching the shortest path in a simple graph or a composed graph using Viterbi and such.

7.2.2.0. (g-viterbi graph) |
(lsh/libgraph/gsearch.lsh) |

Applies viterbi algorithm to compute a graph whose single path is a copy of the best path of graph

7.2.2.1. (g-compose-viterbi graph1 graph2 trans) |
(lsh/libgraph/gsearch.lsh) |

Applies viterbi algorithm to compute the cheapest path in the graph obtained by composing

7.2.2.2. (g-forward graph) |
(lsh/libgraph/gsearch.lsh) |

Returns the log-added costs of all paths in lattice

REMARK: The graph should not have cycles.

7.2.2.3. (g-compose-forward agraph bgraph trans) |
(lsh/libgraph/gsearch.lsh) |

This function returns the log-added costs of all paths in the lattice obtained by composing

REMARK: The composed graph should not have cycles.

7.2.2.4. (g-clear-gradients graph) |
(lsh/libgraph/gsearch.lsh) |

This function clears the gradients

7.2.2.5. (g-backward gradin graph) |
(lsh/libgraph/gsearch.lsh) |

When called immediatly after

REMARK: The graph should not have cycles.