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 graph .
Graph graph should not have cycles.
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 graph1 and
graph2 by transformer trans
. This routine returns a new graph containing only this path.
7.2.2.2. (g-forward graph)
|
(lsh/libgraph/gsearch.lsh) |
Returns the log-added costs of all paths in lattice
graph .
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 agraph and
bgraph with transformer gtrans
.
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 dcost
and dacost in all reachable nodes and
links of the graph graph .
7.2.2.5. (g-backward gradin graph)
|
(lsh/libgraph/gsearch.lsh) |
When called immediatly after g-forward
, this function credits a change gradin
of the result of forward to the cost of each link. The result is added
into the slots dcost of each reachable
link.
REMARK: The graph should not have cycles.