Searched refs:edges (Results 1 – 18 of 18) sorted by relevance
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | avoid_dynamic_node_removal.rst | 7 These are the basic guidelines regarding nodes and edges:
13 - Adding edges and nodes is supported
16 - Removing edges is supported
19 It is possible to add new nodes and edges and to remove old edges from a
|
| H A D | Graph_Object.rst | 7 Conceptually a flow graph is a collection of nodes and edges. Each node
8 belongs to exactly one graph and edges are made only between nodes in
10 this collection of nodes and edges, and is used for invoking whole graph
19 or edges, and therefore no tasks are spawned.
|
| H A D | Graph_Main_Categories.rst | 11 graph's edges. The nodes receive, transform and then pass along the
15 passed along the edges.
|
| H A D | use_make_edge.rst | 7 These are the basic guidelines for creating and removing edges:
21 functions, such as sender<T>::register_successor, to create these edges,
|
| H A D | use_input_node.rst | 34 all other edges are made:
65 edges in reverse topological order; that is, make the edges at the
66 largest depth in the tree first, and work back to the shallowest edges.
|
| H A D | Edges.rst | 7 Most applications contain multiple nodes with edges connecting them to
8 each other. In the flow graph interface, edges are directed channels
|
| H A D | Parallelizing_Flow_Graph.rst | 14 edges. When a node in the graph receives a message, a task is spawned to
16 the graph across the edges that connect the nodes. The following
29 actually flow across the edges; the output of one node becomes the input
|
| H A D | use_graph_reset.rst | 13 can leave its nodes and edges in an indeterminate state. If you want to
|
| H A D | Nodes.rst | 72 messages to it, either by connecting it to other nodes using edges or by
73 invoking its function try_put. Using edges is described in the next
|
| H A D | avoiding_data_races.rst | 7 The edges in a flow graph make explicit the dependence relationships
|
| H A D | communicate_with_nodes.rst | 8 arguments to their constructor. It is only safe to construct edges
|
| H A D | Dependence_Graph.rst | 8 computations and the edges create a partial ordering of these
|
| H A D | Data_Flow_Graph.rst | 189 This final implementation has all of the nodes and edges from the
|
| H A D | Predefined_Node_Types.rst | 49 …ws for the corresponding ports of the composite_node to be used to make edges which hitherto wou…
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | shortpath.cpp | 91 edge_set edges; // edges variable
136 for (std::size_t i = 0; i < edges[u].size(); ++i) { in shortpath_helper()
137 vertex_id v = edges[u][i]; in shortpath_helper()
216 edges.resize(N); in InitializeGraph()
243 edges[i].push_back(j); in InitializeGraph()
250 for (std::size_t j = 0; j < edges[i].size(); ++j) { in InitializeGraph()
251 vertex_id k = edges[i][j]; in InitializeGraph()
252 edges[k].push_back(i); in InitializeGraph()
|
| /oneTBB/examples/graph/cholesky/ |
| H A D | README.md | 8 …t-Cholesky, graph nodes are created instead and these nodes are linked by edges to the other nodes…
10 …flow approach. This is a small, compact graph that passes tiles along its edges. There is one node…
|
| /oneTBB/doc/main/reference/ |
| H A D | make_edges_function.rst | 16 The ``make_edges`` function template creates edges between a single node
|
| /oneTBB/doc/ |
| H A D | Doxyfile.in | 2451 # root by following a path via at most 3 edges will be shown. Nodes that lay
2466 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
|