Searched refs:nshortest (Results 1 - 5 of 5) sorted by relevance
/external/openfst/src/include/fst/script/ |
H A D | shortest-path.h | 34 const size_t nshortest; member in struct:fst::script::ShortestPathOptions 47 nshortest(n), unique(u), has_distance(hasdist), first_path(fp), 75 queue, ArcFilter(), opts.nshortest, opts.unique, 87 queue, ArcFilter(), opts.nshortest, opts.unique, 99 queue, ArcFilter(), opts.nshortest, opts.unique, 111 queue, ArcFilter(), opts.nshortest, opts.unique, 123 queue, ArcFilter(), opts.nshortest, opts.unique, 135 queue, ArcFilter(), opts.nshortest, opts.unique,
|
/external/openfst/src/bin/ |
H A D | fstshortestpath.cc | 25 DEFINE_int64(nshortest, 1, "Return N-shortest paths");
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | shortest-path.h | 37 size_t nshortest; // return n-shortest paths member in struct:fst::ShortestPathOptions 45 nshortest(n), unique(u), has_distance(hasdist) {} 87 if (opts.nshortest != 1) 88 LOG(FATAL) << "SingleShortestPath: for nshortest > 1, use ShortestPath" 220 // property. They need to be left distributive as well for nshortest 237 size_t n = opts.nshortest;
|
/external/openfst/src/include/fst/ |
H A D | shortest-path.h | 44 size_t nshortest; // return n-shortest paths member in struct:fst::ShortestPathOptions 61 nshortest(n), unique(u), has_distance(hasdist), first_path(fp), 105 if (opts.nshortest != 1) { 106 FSTERROR() << "SingleShortestPath: for nshortest > 1, use ShortestPath" 405 // property. They need to be left distributive as well for nshortest 420 size_t n = opts.nshortest;
|
/external/openfst/src/test/ |
H A D | algo_test.h | 789 int nshortest = rand() % kNumRandomShortestPaths + 2; 791 ShortestPath(R, &paths, nshortest, true, false, 849 // Maximum number of nshortest paths. 852 // Maximum number of nshortest states.
|
Completed in 1689 milliseconds