| /third_party/boost/libs/graph_parallel/doc/ |
| D | overview.rst | 17 parallel, distributed computation on graphs. The Parallel BGL contains
18 distributed graph data structures, distributed graph algorithms,
29 .. image:: ../distributed-graph.png
32 :alt: A distributed graph
35 The Parallel BGL is primarily concerned with *distributed*
38 demonstrates a distributed version of the graph above, where the graph
45 distributed graph algorithms, which can operate on any distributed
59 Parallel BGL. The Parallel BGL provides distributed graph data
61 algorithms. The primary data structure is the `distributed adjacency
62 list`_, which allows storage and manipulation of a (distributed)
[all …]
|
| D | breadth_first_search.rst | 25 The ``breadth_first_search()`` function performs a distributed breadth-first
26 traversal of a directed or undirected graph. The distributed BFS is
33 This distributed breadth-first search algorithm implements a
62 The visitor must be a distributed BFS visitor. The suble differences
63 between sequential and distributed BFS visitors are discussed in the
69 darken (white -> gray -> black). The default value is a distributed
75 The queue must be a distributed queue that passes vertices to their
96 triggered by the `sequential breadth-first search`_. The distributed
107 ``u``. Due to incomplete information in distributed property maps,
113 distributed queue prevents duplicates, it will be invoked only
[all …]
|
| D | tsin_depth_first_visit.rst | 42 The ``depth_first_visit()`` function performs a distributed
44 [Tsin02]_ to Cidon's algorithm [Cidon88]_. The distributed DFS is
56 <``boost/graph/distributed/depth_first_search.hpp``>
73 The visitor must be a distributed DFS visitor. The suble differences
74 between sequential and distributed DFS visitors are discussed in the
90 **Default**: A distributed ``iterator_property_map`` created from a
100 **Default**: A distributed ``iterator_property_map`` created from a
108 **Default**: A distributed ``iterator_property_map`` created from a
119 **Default**: A distributed ``iterator_property_map`` created from a
131 triggered by the `sequential depth-first search`_. The distributed
[all …]
|
| D | distributed_property_map.rst | 10 A distributed property map adaptor is a property map whose stored
11 values are distributed across multiple non-overlapping memory spaces
25 Using distributed property maps requires a bit more care than using
27 similar, distributed property maps may contain out-of-date
31 To address the issue of out-of-date values, distributed property
40 directly addressible. There are several forms of distributed property
55 consistency model of a distributed property map can be set with the
110 suitable default. For instance, a distributed property map
112 an infinite value as the default, whereas a distributed
124 The reduction operation of a distributed property map can be set with
[all …]
|
| D | distributed_queue.rst | 41 Class template ``distributed_queue`` implements a distributed queue
42 across a process group. The distributed queue is an adaptor over an
49 distributed queue passes (via a message) the value to its owning
53 Synchronization of distributed queues occurs in the ``empty`` and
55 respectively) when the entire distributed queue is empty. If the local
56 queue is empty but the distributed queue is not, the operation will
61 introduction of a distributed queue:
81 The distributed queue can receive messages at two different times:
95 The distributed queue nearly models the Buffer_
110 Build a new distributed queue that communicates over the given
[all …]
|
| D | local_subgraph.rst | 12 the local portion of the distributed graph to the user. The behavior
26 <boost/graph/distributed/local_subgraph.hpp>
31 distributed graphs, the signatures of which will be omitted. Only
42 distributed graph ``g``.
51 Returns the underlying distributed graph.
62 distributed graph ``g``.
|
| D | distributed_adjacency_list.rst | 15 The distributed adjacency list implements a graph data structure using
18 class template. However, the distributed adjacency list partitions the
36 To create a distributed adjacency list, first determine the
42 coordinating processes that will store the distributed graph. For
50 The following ``typedef`` defines a distributed adjacency list
52 distributed over several processes, using the MPI process group
68 Vertex and edge properties for distributed graphs mirror their
69 counterparts for non-distributed graphs. With a distributed graph,
73 The most direct way to attach properties to a distributed graph is to
116 To create a distributed graph for a road map, we supply ``City`` and
[all …]
|
| D | strong_components.rst | 31 components of a directed graph. The distributed strong components
33 identify components local to a processor. The distributed portion of
34 the algorithm is built on the `distributed breadth first search`_
41 The distributed strong components algorithm works on both ``directed``
51 <``boost/graph/distributed/strong_components.hpp``>
91 `Bidirectional Graph`_ concept) or a `distributed adjacency list`_
102 bidirectional) or a distributed ``iterator_property_map`` (if the
113 bidirectional) or a distributed ``iterator_property_map`` (if the
132 The parallel phase of the distributed strong components algorithm
135 any remaining strong components. A `distributed breadth first search`_
[all …]
|
| D | distributedS.rst | 14 storage in a ``std::list``. The Parallel BGL's `distributed
16 that indicates that the storage should be distributed across multiple
18 into a distributed adjacency list.
31 distributed and also the medium for communication. This type must
|
| D | process_group.rst | 52 the BSP model with support for multiple distributed data structures,
60 distributed data structures working in concern. For example, a simple
61 breadth-first search involves the distributed graph data structure
62 containing the graph itself, a distributed queue that manages the
63 traversal through the graph, and a distributed property map that
67 The Parallel BGL manages these distributed data structures by allowing
69 itself. When a distributed data structure attaches to the process
71 distributed data structure to communicate without colliding with the
72 communications from other distributed data structures. When the
73 process group is synchronized, all of the distributed data structures
[all …]
|
| D | dijkstra_shortest_paths.rst | 34 distributed graph. There are two implementations of distributed
38 distributed Dijkstra algorithms are very similar to their sequential
56 supported and have essentially the same meaning. The distributed
84 The visitor must be a distributed Dijkstra visitor. The suble differences
85 between sequential and distributed Dijkstra visitors are discussed in the
92 darken (white -> gray -> black). The default value is a distributed
101 Lookahead permits distributed Dijkstra's algorithm to speculatively
119 triggered by the `sequential Dijkstra implementation`_. The distributed
131 ``u``. Due to incomplete information in distributed property maps,
156 ``edge_relaxed`` events in distributed Dijkstra's algorithm.
[all …]
|
| /third_party/boost/tools/boostdep/depinst/ |
| D | exceptions.txt | 93 boost/graph/distributed/adjacency_list.hpp
94 boost/graph/distributed/adjlist/handlers.hpp
95 boost/graph/distributed/adjlist/initialize.hpp
96 boost/graph/distributed/adjlist/redistribute.hpp
97 boost/graph/distributed/adjlist/serialization.hpp
98 boost/graph/distributed/betweenness_centrality.hpp
99 boost/graph/distributed/boman_et_al_graph_coloring.hpp
100 boost/graph/distributed/breadth_first_search.hpp
101 boost/graph/distributed/compressed_sparse_row_graph.hpp
102 boost/graph/distributed/concepts.hpp
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | page_rank.hpp | 29 namespace boost { namespace graph { namespace distributed { namespace
135 graph::distributed::detail::page_rank_step(g, rank_map, win2, damping, owner); in page_rank_impl()
138 graph::distributed::detail::page_rank_step(g, rank_map2, win, damping, owner); in page_rank_impl()
220 using distributed::page_rank;
221 using distributed::remove_dangling_links;
|
| D | mpi_process_group.hpp | 35 namespace boost { namespace graph { namespace distributed { namespace
787 BOOST_IS_BITWISE_SERIALIZABLE(boost::graph::distributed::mpi_process_group::message_header)
790 …struct is_mpi_datatype<boost::graph::distributed::mpi_process_group::message_header> : mpl::true_ …
796 swap(boost::graph::distributed::mpi_process_group::outgoing_messages& x, in swap()
797 boost::graph::distributed::mpi_process_group::outgoing_messages& y) in swap()
805 BOOST_CLASS_IMPLEMENTATION(boost::graph::distributed::mpi_process_group::outgoing_messages,object_s…
806 BOOST_CLASS_TRACKING(boost::graph::distributed::mpi_process_group::outgoing_messages,track_never)
|
| /third_party/grpc/test/core/http/ |
| D | BUILD | 10 # distributed under the License is distributed on an "AS IS" BASIS,
58 # distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/node/deps/cares/ |
| D | README.md | 25 c-ares is of course distributed under the same MIT-style license as the
35 * The distributed `ares_build.h` file is only intended to be used on systems
36 which can not run the also distributed configure script.
38 * The distributed `ares_build.h` file is generated as a copy of `ares_build.h.dist`
46 will overwrite the distributed `ares_build.h` file with one that is suitable
|
| /third_party/skia/third_party/externals/oboe/apps/fxlab/ |
| D | settings.gradle | 11 * distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/libphonenumber/resources/test/geocoding/ko/ |
| D | 82.txt | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/grpc/ |
| D | NOTICE.txt | 10 distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/libphonenumber/resources/carrier/fa/ |
| D | 93.txt | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/libphonenumber/cpp/ |
| D | LICENSE | 10 distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/grpc/examples/objective-c/helloworld/HelloWorld/ |
| D | AppDelegate.m | 12 * distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/libphonenumber/resources/carrier/en/ |
| D | 269.txt | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/flutter/skia/third_party/externals/dawn/build_overrides/ |
| D | glslang.gni | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|
| /third_party/grpc/bazel/ |
| D | custom_exec_properties.bzl | 10 # distributed under the License is distributed on an "AS IS" BASIS,
|