| /third_party/boost/libs/graph_parallel/doc/ |
| D | betweenness_centrality.rst | 109 part of shortest paths to that vertex. The ``IncomingMap`` type
119 shortest paths portion of the algorithm. The ``DistanceMap`` type
137 The path count map records the number of shortest paths each vertex
170 Computing the shortest paths, counting them, and computing the
172 betweenness centrality requires counting the shortest paths from all
182 shortest path tree using an ``IncomingMap``. The ``IncomingMap``
183 contains the source of all incoming edges on shortest paths.
185 The ``IncomingMap`` defines the shortest path DAG at the target of the
186 edges in the shortest paths tree. In the bidirectional case edge
187 flags could be used to translate the shortest paths information to the
[all …]
|
| D | non_distributed_betweenness_centrality.rst | 75 the individual shortest paths calculations that are required by
77 shortest paths calculations in parallel with each process in ``pg``
78 calculating the shortest path from a different set of source vertices
79 using the BGL's implementation of `Dijkstra shortest paths`_. Each
81 shortest paths calculations are performed a reduction is performed to
119 part of shortest paths to that vertex. Its key type must be the
129 shortest paths portion of the algorithm. Its key type must be the
144 The path count map records the number of shortest paths each vertex
176 Each of the shortest paths calculations is *O(V log V)* and each of
179 shortest paths phase is *O(V log V)*.
[all …]
|
| D | index.rst | 71 - `Dijkstra's single-source shortest paths`_
73 - `Eager Dijkstra shortest paths`_
74 - `Crauser et al. Dijkstra shortest paths`_
75 - `Delta-Stepping shortest paths`_
137 .. _Dijkstra's single-source shortest paths: dijkstra_shortest_paths.html
138 .. _Eager Dijkstra shortest paths: dijkstra_shortest_paths.html#eager-dijkstra-s-algorithm
139 .. _Crauser et al. Dijkstra shortest paths: dijkstra_shortest_paths.html#crauser-et-al-s-algorithm
140 .. _Delta-Stepping shortest paths: dijkstra_shortest_paths.html#delta-stepping-algorithm
|
| D | dijkstra_shortest_paths.rst | 33 shortest paths problem on a weighted, undirected or directed
102 process vertices whose shortest distance from the source may not
103 have been found yet. When the distance found is the shortest
105 more quickly. However, if the distance is not the shortest distance,
386 Sanders. Parallelizing Dijkstra's shortest path algorithm. Technical
390 shortest path algorithm. In *6th ESA*, LNCS. Springer, 1998.
|
| D | dijkstra_example.rst | 11 the shortest paths from vertex A to every other vertex in the
16 With the sequential BGL_, the program to calculate shortest paths has
73 the shortest paths themselves). In our case, we will create two
|
| D | st_connected.rst | 81 where *d* is the shortest distance from ``s`` to ``t``. Over all
|
| /third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/util/ |
| D | Timer.java | 109 long shortest = Long.MAX_VALUE; in timeIterations() local
117 return Math.min(duration, shortest); in timeIterations()
120 shortest = Math.min(duration, shortest); in timeIterations()
|
| /third_party/flutter/skia/third_party/externals/harfbuzz/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()
|
| /third_party/harfbuzz/src/ |
| D | hb-ot-shape-normalize.cc | 125 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) in decompose() argument
136 if (shortest && has_a) { in decompose()
147 if ((ret = decompose (c, shortest, a))) { in decompose()
168 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest) in decompose_current_character() argument
174 if (shortest && c->font->get_nominal_glyph (u, &glyph)) in decompose_current_character()
180 if (decompose (c, shortest, u)) in decompose_current_character()
186 if (!shortest && c->font->get_nominal_glyph (u, &glyph)) in decompose_current_character()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-ot-shape-normalize.cc | 125 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) in decompose() argument
136 if (shortest && has_a) { in decompose()
147 if ((ret = decompose (c, shortest, a))) { in decompose()
168 decompose_current_character (const hb_ot_shape_normalize_context_t *c, bool shortest) in decompose_current_character() argument
174 if (shortest && c->font->get_nominal_glyph (u, &glyph, c->not_found)) in decompose_current_character()
180 if (decompose (c, shortest, u)) in decompose_current_character()
186 if (!shortest && c->font->get_nominal_glyph (u, &glyph, c->not_found)) in decompose_current_character()
|
| /third_party/boost/libs/graph/example/ |
| D | dijkstra.expected | 8 shortest paths tree
|
| /third_party/skia/third_party/externals/harfbuzz/docs/ |
| D | repacker.md | 83 * Sorting by shortest distance
85 Kahn's algorithm is approximately twice as fast as the shortest distance sort so that is attempted
86 first (only on the first topological sort). If it fails to eliminate overflows then shortest distan…
97 The distance of a node is the sum of all weights along the shortest path from the root to that node
102 The shortest distance to each node is determined using
105 based on the shortest distance to each node.
132 If a graph contains multiple 32 bit offsets then the shortest distance sorting will be likely be
134 to a subgraph which are not connected to each other. The shortest distance sort will interleave the
147 Where the links from a to b and a to c are 32 bit offsets, the shortest distance sort would be:
|
| /third_party/ltp/testcases/realtime/func/sched_jitter/ |
| D | README | 7 execution time - the shortest execution time).
|
| /third_party/ffmpeg/libavfilter/ |
| D | vf_stack.c | 45 int shortest; member
365 in[i].after = s->shortest ? EXT_STOP : EXT_INFINITY; in config_output()
397 …{ "shortest", "force termination when the shortest input terminates", OFFSET(shortest), AV_OPT_TYP…
455 …{ "shortest", "force termination when the shortest input terminates", OFFSET(shortest), AV_OPT_TYP…
|
| /third_party/boost/boost/graph/ |
| D | gursoy_atun_layout.hpp | 190 typedef detail::gursoy_shortest< EdgeWeightMap > shortest; in gursoy_atun_step() typedef
191 shortest::run( in gursoy_atun_step()
|
| /third_party/ffmpeg/fftools/ |
| D | ffmpeg.h | 154 int shortest; member
562 int shortest; member
|
| /third_party/boost/libs/locale/doc/ |
| D | recommendations_and_myths.txt | 39 …that UTF-16 is the best encoding for storing information because it gives "shortest" representation
|
| /third_party/python/Doc/library/ |
| D | email.charset.rst | 63 ``Charset.SHORTEST`` for the shortest of QP or BASE64 encoding. Otherwise,
180 ``Charset.SHORTEST`` for the shortest of quoted-printable or base64 encoding,
|
| /third_party/json/doc/mkdocs/docs/features/binary_formats/ |
| D | ubjson.md | 33 string | *with shortest length indicator* | string | `S`
|
| /third_party/flutter/flutter/packages/flutter/lib/src/painting/ |
| D | continuous_rectangle_border.dart | 94 // Radii will be clamped to the value of the shortest side
|
| /third_party/ffmpeg/doc/ |
| D | formats.texi | 74 @item shortest
75 Stop muxing at the end of the shortest stream.
|
| /third_party/libpsl/include/ |
| D | libpsl.h.in | 146 /* returns the shortest possible registrable domain part or NULL if domain is not registrable at al…
|
| /third_party/flutter/flutter/packages/flutter/test/widgets/ |
| D | basic_test.dart | 44 // the shortest edge, so we get a circle of radius 300, centered at
|
| /third_party/libpsl/ |
| D | README.md | 35 - finds the shortest private part of a given domain
|
| /third_party/flutter/flutter/packages/flutter/lib/src/physics/ |
| D | spring_simulation.dart | 66 /// shortest possible time.
|