HomeSort by relevance Sort by last modified time
    Searched refs:ShortestPath (Results 1 - 10 of 10) sorted by null

  /external/openfst/src/script/
shortest-path.cc 24 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst,
27 if (!ArcTypesMatch(ifst, *ofst, "ShortestPath")) return;
30 Apply<Operation<ShortestPathArgs1> >("ShortestPath", ifst.ArcType(), &args);
33 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst,
36 if (!ArcTypesMatch(ifst, *ofst, "ShortestPath")) return;
40 Apply<Operation<ShortestPathArgs2> >("ShortestPath", ifst.ArcType(), &args);
44 REGISTER_FST_OPERATION(ShortestPath, StdArc, ShortestPathArgs1);
45 REGISTER_FST_OPERATION(ShortestPath, LogArc, ShortestPathArgs1);
46 REGISTER_FST_OPERATION(ShortestPath, Log64Arc, ShortestPathArgs1);
48 REGISTER_FST_OPERATION(ShortestPath, StdArc, ShortestPathArgs2)
    [all...]
  /external/openfst/src/include/fst/script/
shortest-path.h 57 void ShortestPath(ShortestPathArgs1 *args) {
78 ShortestPath(ifst, ofst, &weights, spopts);
90 ShortestPath(ifst, ofst, &weights, spopts);
102 ShortestPath(ifst, ofst, &weights, spopts);
114 ShortestPath(ifst, ofst, &weights, spopts);
126 ShortestPath(ifst, ofst, &weights, spopts);
138 ShortestPath(ifst, ofst, &weights, spopts);
160 void ShortestPath(ShortestPathArgs2 *args) {
166 ShortestPath(ifst, ofst, args->arg3, args->arg4, args->arg5,
172 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst
    [all...]
fstscript.h 139 REGISTER_FST_OPERATION(ShortestPath, Arc, ShortestPathArgs1);
140 REGISTER_FST_OPERATION(ShortestPath, Arc, ShortestPathArgs2);
  /external/openfst/src/bin/
fstshortestpath.cc 87 s::ShortestPath(*ifst, &ofst, &distance, opts);
  /external/openfst/src/include/fst/extensions/pdt/
pdtscript.h 185 // PDT SHORTESTPATH
226 ShortestPath(fst, parens, ofst, spopts);
233 ShortestPath(fst, parens, ofst, spopts);
240 ShortestPath(fst, parens, ofst, spopts);
shortest-path.h 424 void ShortestPath(MutableFst<Arc> *ofst) {
776 void ShortestPath(const Fst<Arc> &ifst,
782 psp.ShortestPath(ofst);
786 void ShortestPath(const Fst<Arc> &ifst,
793 psp.ShortestPath(ofst);
expand.h 365 reverse_shortest_path_->ShortestPath(&path);
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
shortest-path.h 50 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
88 LOG(FATAL) << "SingleShortestPath: for nshortest > 1, use ShortestPath"
228 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
248 LOG(FATAL) << "ShortestPath: n-shortest: Weight needs to have the "
252 LOG(FATAL) << "ShortestPath: n-shortest-string algorithm not "
351 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
358 ShortestPath(ifst, ofst, &distance, opts);
  /external/openfst/src/include/fst/
shortest-path.h 67 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
106 FSTERROR() << "SingleShortestPath: for nshortest > 1, use ShortestPath"
413 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
427 FSTERROR() << "ShortestPath: n-shortest: Weight needs to have the "
484 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
496 ShortestPath(ifst, ofst, &distance, opts);
  /external/openfst/src/test/
algo_test.h 779 ShortestPath(T, &path);
791 ShortestPath(R, &paths, nshortest, true, false,
803 ShortestPath(R, &path);
    [all...]

Completed in 165 milliseconds