Searched refs:adjacency (Results 1 – 25 of 91) sorted by relevance
1234
15 adjacency list`_ supports an additional selector, ``distributedS``,17 processes. This selector can transform a sequential adjacency list18 into a distributed adjacency list.47 .. _Distributed adjacency list: distributed_adjacency_list.html
47 - `Distributed adjacency list`_62 .. _Distributed adjacency list: distributed_adjacency_list.html
61 algorithms. The primary data structure is the `distributed adjacency66 illustrates the distributed adjacency list representation.71 :alt: A distributed adjacency list80 The `distributed adjacency list`_ distributes the structure of a graph135 .. _Distributed adjacency list: distributed_adjacency_list.html
15 The distributed adjacency list implements a graph data structure using16 an adjacency list representation. Its interface and behavior are18 class template. However, the distributed adjacency list partitions the36 To create a distributed adjacency list, first determine the50 The following ``typedef`` defines a distributed adjacency list133 distributed adjacency lists that store vertices in a vector158 adjacency list supports named vertices, which provides an implicit170 The distributed adjacency list will find vertices associated with the198 the distributed adjacency list.203 default, the distributed adjacency list will throw an exception if a[all …]
69 - `Distributed adjacency list`_86 .. _Distributed adjacency list: distributed_adjacency_list.html
35 identifies the roots of its local components. An adjacency list of41 attempts to hook to a member of it's adjacency list by assigning it's54 phase transmit their adjacency list to their new parent. The56 their adjacency lists to remove vertices that are now members of their
224 `distributed adjacency list`_ graph type. To load a METIS graph using245 that to distributed the adjacency list. Note that the input stream312 .. _distributed adjacency list: distributed_adjacency_list.html
41 - `Distributed adjacency list`_122 .. _Distributed adjacency list: distributed_adjacency_list.html
1 KHR-GLESEXT.geometry_shader.adjacency.adjacency_non_indiced_lines2 KHR-GLESEXT.geometry_shader.adjacency.adjacency_indiced_lines3 KHR-GLESEXT.geometry_shader.adjacency.adjacency_non_indiced_line_strip4 KHR-GLESEXT.geometry_shader.adjacency.adjacency_indiced_line_strip5 KHR-GLESEXT.geometry_shader.adjacency.adjacency_non_indiced_triangles6 KHR-GLESEXT.geometry_shader.adjacency.adjacency_indiced_triangles7 KHR-GLESEXT.geometry_shader.adjacency.adjacency_non_indiced_triangle_strip8 KHR-GLESEXT.geometry_shader.adjacency.adjacency_indiced_triangle_strip
8 // implementation of a graph declared in adjacency list format28 // tag identifying graph implementation as adjacency list (not defined)97 // adjacency list supports zero-degree vertices, which incidence list does not
15 KHR-GLES32.core.geometry_shader.adjacency.adjacency_non_indiced_lines16 KHR-GLES32.core.geometry_shader.adjacency.adjacency_indiced_lines17 KHR-GLES32.core.geometry_shader.adjacency.adjacency_non_indiced_line_strip18 KHR-GLES32.core.geometry_shader.adjacency.adjacency_indiced_line_strip19 KHR-GLES32.core.geometry_shader.adjacency.adjacency_non_indiced_triangles20 KHR-GLES32.core.geometry_shader.adjacency.adjacency_indiced_triangles21 KHR-GLES32.core.geometry_shader.adjacency.adjacency_non_indiced_triangle_strip22 KHR-GLES32.core.geometry_shader.adjacency.adjacency_indiced_triangle_strip
479 BITSET_SET(g->nodes[n1].adjacency, n2); in ra_add_node_adjacency()493 BITSET_CLEAR(g->nodes[n1].adjacency, n2); in ra_node_remove_adjacency()523 assert(g->nodes[i].adjacency != NULL); in ra_realloc_interference_graph()524 g->nodes[i].adjacency = rerzalloc(g, g->nodes[i].adjacency, BITSET_WORD, in ra_realloc_interference_graph()531 g->nodes[i].adjacency = rzalloc_array(g, BITSET_WORD, bitset_count); in ra_realloc_interference_graph()615 if (n1 != n2 && !BITSET_TEST(g->nodes[n1].adjacency, n2)) { in ra_add_node_interference()628 memset(g->nodes[n].adjacency, 0, in ra_reset_node_interference()
95 BITSET_WORD *adjacency; member
153 line adjacency 4i-2 4i-1154 line strip adjacency i+1 i+2155 triangle adjacency 6i-5 6i-1156 triangle strip adjacency 2i-1 2i+3199 the rows of table 2.12 for line adjacency, line strip adjacency,200 triangle adjacency, and triangle strip adjacency.
68 types: lines with adjacency, line strips with adjacency, separate69 triangles with adjacency, and triangle strips with adjacency. Some of the161 (add figure on discussions of lines and line strips with adjacency)169 Figure 2.X1 (a) Lines with adjacency, (b) Line strip with adjacency.176 Lines with adjacency are independent line segments where each endpoint has188 Lines with adjacency are generated by calling Begin with the argument193 Line strips with adjacency are similar to line strips, except that each205 Line strips with adjacency are generated by calling Begin with the210 (add figure and discussion of triangles with adjacency)230 Figure 2.X2 Triangles with adjacency. The vertices connected with solid[all …]
71 adjacency, line strips with adjacency, separate triangles with adjacency,72 and triangle strips with adjacency. Some of the vertices specified in76 (triangles/tstrips). These "adjacency" vertices can be accessed by181 Figure X.1 (a) Lines with adjacency, (b) Line strip with adjacency. 188 Lines with adjacency are independent line segments where each endpoint has200 Lines with adjacency are generated by calling Begin with the argument205 Line strips with adjacency are similar to line strips, except that each217 Line strips with adjacency are generated by calling Begin with the239 Figure X.2 Triangles with adjacency. The vertices connected with solid245 Triangles with adjacency are similar to separate triangles, except that[all …]
183 line adjacency 4i-2 4i-1184 line strip adjacency i+1 i+2185 triangle adjacency 6i-5 6i-1186 triangle strip adjacency 2i-1 2i+3229 * ignore the rows of table 2.12 for line adjacency, line strip230 adjacency, triangle adjacency, and triangle strip adjacency.
193 line adjacency 4i-2 4i-1194 line strip adjacency i+1 i+2195 triangle adjacency 6i-5 6i-1196 triangle strip adjacency 2i-1 2i+3239 * ignore the rows of table 2.12 for line adjacency, line strip240 adjacency, triangle adjacency, and triangle strip adjacency.