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

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
topsort.h 38 // If acyclic, ORDER[i] gives the topological position of state Id i;
39 // otherwise unchanged. ACYCLIC will be true iff the FST has
41 TopOrderVisitor(vector<StateId> *order, bool *acyclic)
42 : order_(order), acyclic_(acyclic) {}
77 // Topologically sorts its input if acyclic, modifying it. Otherwise,
90 bool acyclic; local
92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
95 if (acyclic) {
102 return acyclic;
queue.h 280 // States are ordered in the queue topologically. The FST must be acyclic.
294 bool acyclic; local
295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);
297 if (!acyclic)
298 LOG(FATAL) << "TopOrderQueue: fst is not acyclic.";
548 // If all the scc are trivial, FST is acyclic and the scc# gives
rmepsilon.h 209 // States sorted in topological order when (acyclic) or generic
218 bool acyclic; local
219 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
221 if (!acyclic)
222 LOG(FATAL) << "RmEpsilon: not acyclic though property bit is set";
277 // - Acyclic: O(V2 + V E)

Completed in 311 milliseconds