Home
last modified time | relevance | path

Searched refs:nshortest (Results 1 – 4 of 4) sorted by relevance

/external/openfst/src/include/fst/script/
Dshortest-path.h34 const size_t nshortest; member
47 nshortest(n), unique(u), has_distance(hasdist), first_path(fp), in ShortestDistanceOptions()
75 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
87 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
99 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
111 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
123 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
135 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
/external/openfst/src/include/fst/
Dshortest-path.h44 size_t nshortest; // return n-shortest paths member
61 nshortest(n), unique(u), has_distance(hasdist), first_path(fp),
105 if (opts.nshortest != 1) { in SingleShortestPath()
420 size_t n = opts.nshortest; in ShortestPath()
/external/openfst/src/bin/
Dfstshortestpath.cc25 DEFINE_int64(nshortest, 1, "Return N-shortest paths");
/external/openfst/src/test/
Dalgo_test.h789 int nshortest = rand() % kNumRandomShortestPaths + 2; in TestSearch() local
791 ShortestPath(R, &paths, nshortest, true, false, in TestSearch()