Searched refs:adjacency (Results 1 – 8 of 8) sorted by relevance
30 >2 byte 131 (adjacency graph)31 >2 byte 132 (adjacency graph library)
80 static int adjacency[16][16] = { variable204 adjacency[i][i] = 1; in main()481 if (adjacency[prev][lm[i]]) { in checkword()
4629 (partial_bitnum, max_bitnum, adjacency_pool, adjacency): New variables.4639 Use the new adjacency list to visit an allocno's neighbors4649 Only allocate the conflict bit matrix and adjacency lists if4660 (partial_bitnum, max_bitnum, adjacency, adjacency_pool):
28879 row of the adjacency matrix of edges.28882 the adjacency matrix of edges.
4562 … represented either (i) as an ordered list of edges or (ii) as a packed adjacency matrix. If $w$ d…4566 … decomposition; lobe decomposition graph; ordered list of edges; packed adjacency matrix; separabl…16134 …ite undirected graph; graph theory; Paton's algorithm; PL/I; subroutines; vertex adjacency matrix",20094 …ch performs eliminations on the basis of local properties of the region adjacency graph. The schem…
8042 @c major node below. Node defaulting in makeinfo requires adjacency of
8179 @c major node below. Node defaulting in makeinfo requires adjacency of
2580 adjacency