| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| D | graphalgo.rst | 9 Dijkstra's algorithm for shortest paths.
11 Find shortest paths from the start node to all nodes nearer
18 … vertex is reached), but will correctly compute shortest paths even for some graphs with negative
24 Find a single shortest path from the given start node to the given end node.
26 of the nodes in order along the shortest path.
|
| D | index.rst | 10 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| D | core.rst | 18 topological sort, finding connected components, shortest paths as well as a number
|
| D | graph.rst | 279 corresponds to the shortest distance between the nodes.
|
| /external/strace/ |
| D | count.c | 48 static struct timeval shortest = { 1000000, 0 }; variable
94 if (tv_cmp(&shortest, &one_tick) < 0) in count_syscall()
95 tv = &shortest; in count_syscall()
100 if (tv_cmp(tv, &shortest) < 0) in count_syscall()
101 shortest = *tv; in count_syscall()
174 tv_mul(&overhead, &shortest, 8); in call_summary_pers()
|
| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| D | Timer.java | 104 long shortest = Long.MAX_VALUE; in timeIterations() local
112 return Math.min(duration, shortest); in timeIterations()
115 shortest = Math.min(duration, shortest); in timeIterations()
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| D | Timer.java | 105 long shortest = Long.MAX_VALUE; in timeIterations() local
113 return Math.min(duration, shortest); in timeIterations()
116 shortest = Math.min(duration, shortest); in timeIterations()
|
| /external/harfbuzz_ng/src/ |
| D | hb-ot-shape-normalize.cc | 120 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) in decompose() argument
131 if (shortest && has_a) { in decompose()
142 if ((ret = decompose (c, shortest, a))) { in decompose()
163 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest) in decompose_current_character() argument
169 if (shortest && c->font->get_nominal_glyph (u, &glyph)) in decompose_current_character()
175 if (decompose (c, shortest, u)) in decompose_current_character()
181 if (!shortest && c->font->get_nominal_glyph (u, &glyph)) in decompose_current_character()
|
| /external/opencv3/modules/shape/src/ |
| D | haus_dis.cpp | 116 Mat shortest(disMat.rows,1,CV_32F); in _apply() local
122 shortest.at<float>(ii,0) = float(mindis); in _apply()
125 cv::sort(shortest, sorted, SORT_EVERY_ROW | SORT_DESCENDING); in _apply()
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/ |
| D | README.txt | 2 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| D | README.chromium | 9 constructing graphs, BFS and DFS traversals, topological sort, shortest paths,
|
| D | PKG-INFO | 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /external/autotest/server/site_tests/network_WiFi_SimpleConnect/ |
| D | control.wifi_checkSSIDLimits | 17 longest and shortest possible SSIDs.
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_contours/py_contours_more_functions/ |
| D | py_contours_more_functions.markdown | 9 - Finding shortest distance from a point to a polygon
66 This function finds the shortest distance between a point in the image and a contour. It returns the
|
| /external/v8/test/cctest/ |
| D | cctest.gyp | 96 'gay-shortest.cc',
290 # MSVS wants this for gay-{precision,shortest}.cc.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph.egg-info/ |
| D | PKG-INFO | 11 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| /external/libpng/contrib/gregbook/ |
| D | README | 185 All options can be abbreviated to the shortest unique value; for example,
|
| /external/llvm/lib/Target/PowerPC/ |
| D | README_ALTIVEC.txt | 301 shortest instruction sequence for implementing a shufflevector operation on
|
| /external/llvm/docs/TableGen/ |
| D | LangRef.rst | 77 TokCodeFragment: "[{" <shortest text not containing "}]"> "}]"
|
| /external/opencv3/doc/py_tutorials/py_calib3d/py_calibration/ |
| D | py_calibration.markdown | 172 This is the shortest path. Just call the function and use ROI obtained above to crop the result.
|
| /external/pcre/dist/doc/ |
| D | pcretest.txt | 659 \F only shortest match for pcre[16|32]_dfa_exec()
780 first match is found. This is always the shortest possible match.
|
| /external/llvm/docs/ |
| D | MergeFunctions.rst | 221 equal functions *F`* in shortest time, and merge them into the single function.
|
| /external/srtp/doc/ |
| D | Doxyfile | 128 # to NO the shortest path that makes the file name unique will be used.
|
| /external/xmlrpcpp/src/ |
| D | Doxyfile | 127 # to NO the shortest path that makes the file name unique will be used.
|
| /external/bison/doc/ |
| D | Doxyfile.in | 85 # to NO the shortest path that makes the file name unique will be used.
|