/external/openfst/src/include/fst/ |
topsort.h | 43 // If acyclic, ORDER[i] gives the topological position of state Id i; 44 // otherwise unchanged. ACYCLIC will be true iff the FST has 46 TopOrderVisitor(vector<StateId> *order, bool *acyclic) 47 : order_(order), acyclic_(acyclic) {} 82 // Topologically sorts its input if acyclic, modifying it. Otherwise, 95 bool acyclic; local 97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 100 if (acyclic) { 107 return acyclic;
|
minimize.h | 302 // Computes equivalence classes for acyclic Fsts. The implementation details 305 // Minimization of acyclic deterministic automata in linear time 500 // Acyclic minimization (revuz) 501 VLOG(2) << "Acyclic Minimization"; 523 // In the acyclic case, we use an algorithm from Dominique Revuz that
|
rmepsilon.h | 252 // States sorted in topological order when (acyclic) or generic 262 bool acyclic; local 263 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 265 // Sanity check: should be acyclic if property bit is set. 266 if(!acyclic) { 267 FSTERROR() << "RmEpsilon: inconsistent acyclic property bit"; 338 // - Acyclic: O(V2 + V E)
|
connect.h | 128 // SCC numbers will be in topological order for acyclic input. 174 // Numbers SCC's in topological order when acyclic.
|
replace-util.h | 407 bool acyclic = false; local 409 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic); 411 if (!acyclic) {
|
queue.h | 311 // States are ordered in the queue topologically. The FST must be acyclic. 324 bool acyclic; local 325 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic); 327 if (!acyclic) { 328 FSTERROR() << "TopOrderQueue: fst is not acyclic."; 586 // If all the scc are trivial, FST is acyclic and the scc# gives
|
determinize.h | 783 // The determinizable automata include all unweighted and all acyclic input. [all...] |
/external/openfst/src/bin/ |
fsttopsort.cc | 47 bool acyclic = TopSort(fst); 48 if (!acyclic)
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
dag.py | 4 """Algorithms for directed acyclic graphs (DAGs).""" 58 """Return True if the graph G is a directed acyclic graph (DAG) or 101 If G is not a directed acyclic graph (DAG) no topological sort 175 If G is not a directed acyclic graph (DAG) no topological sort 244 acyclic as every integer trivial divides length 0 cycles.
|
/external/openfst/src/lib/ |
properties.cc | 286 bool acyclic = true; local 296 acyclic = false; 306 if (acyclic) 422 "cyclic", "acyclic", 423 "cyclic at initial state", "acyclic at initial state",
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
GrammarReport.java | 403 // buf.append("Min acyclic DFA states: "); buf.append(fields[13]); 405 // buf.append("Max acyclic DFA states: "); buf.append(fields[14]); 407 // buf.append("Average acyclic DFA states: "); buf.append(fields[15]); 409 // buf.append("Standard deviation of acyclic DFA states: "); buf.append(fields[16]); 411 // buf.append("Total acyclic DFA states: "); buf.append(fields[17]);
|
/external/llvm/include/llvm/ADT/ |
DAGDeltaAlgorithm.h | 18 /// directed acyclic graphs using a predicate function.
|
/external/llvm/docs/ |
Lexicon.rst | 60 Directed Acyclic Graph
|
/external/openfst/ |
NEWS | 92 * Fixed bug in acyclic minimization that led to non-minimal
|
/frameworks/av/include/cpustats/ |
ThreadCpuUsage.h | 30 // For acyclic threads, or for cyclic threads where you want to measure/track
|
/external/compiler-rt/lib/tsan/rtl/ |
tsan_mutex.cc | 117 // Verify that the graph is acyclic.
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/chordal/ |
chordal_alg.py | 71 selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984),
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/components/ |
strongly_connected.py | 343 the resulting graph is a directed acyclic graph.
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
CodeGenerator.java | 138 /** I have factored out the generation of acyclic DFAs to separate class */ 635 // If we are doing inline DFA and this one is acyclic and LL(*) 644 // generate any kind of DFA here (cyclic or acyclic) [all...] |
/frameworks/base/rs/java/android/renderscript/ |
ScriptGroup.java | 35 * effectively making it a directed acyclic graph (DAG) of kernels. 517 * A ScriptGroup must contain a single directed acyclic graph (DAG); it [all...] |
/frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
ScriptGroup.java | 38 * effectively making it a directed acyclic graph (DAG) of kernels. 602 * A ScriptGroup must contain a single directed acyclic graph (DAG); it [all...] |
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | [all...] |
ScheduleDAG.cpp | 436 /// a directed acyclic graph" by David J. Pearce and Paul H.J. Kelly
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
DFA.java | 659 * To force an acyclic, fixed maximum depth DFA, just always 757 /** The user may specify a max, acyclic lookahead for any decision. No [all...] |
/external/antlr/antlr-3.4/runtime/C/ |
README | 337 When forcing some acyclic DFA to be state tables, they broke. 436 acyclic inline DFA (i.e., using an IF). Upon non-LL(*) decisions 439 a protection in front of the acyclic DFA generator to avoid if 933 * no more computing DFA transition tables for acyclic DFA. [all...] |