Searched refs:ND_id (Results 1 – 16 of 16) sorted by relevance
106 row = ND_id(n); in attach_edge_colors()167 ND_id(n) = i++; in SparseMatrix_import_dot()189 row = ND_id(n); in SparseMatrix_import_dot()227 i = ND_id(n); in SparseMatrix_import_dot()256 i = ND_id(n); in SparseMatrix_import_dot()354 ND_id(n) = i++; in Import_dot_splines()543 ND_id(n) = i; in makeDotGraph()596 i = ND_id(n); in makeDotGraph()781 i = ND_id(n); in Dot_SetClusterColor()987 i = ND_id(n); in Import_coord_clusters_from_dot()[all …]
97 Agedge_t** tail_edgelist = nbrs[ND_id(tail)]; in reweightEdge()98 long int len0 = nbrs[ND_id(tail)+1] - tail_edgelist; in reweightEdge()99 Agedge_t** head_edgelist = nbrs[ND_id(head)]; in reweightEdge()229 ND_id(n) = i++; in setEdgeWeights()238 que[ND_id(n)] = iwt; in setEdgeWeights()253 sqrt((double) (que[ND_id(n)] * que[ND_id(aghead(e))])); in setEdgeWeights()274 nbrs[ND_id(n)] = edgelist; in setEdgeWeights()293 edgelist = nbrs[ND_id(n)]; in setEdgeWeights()294 long int len0 = nbrs[ND_id(n)+1] - edgelist; in setEdgeWeights()311 edgelist = nbrs[ND_id(n)]; in setEdgeWeights()[all …]
56 ND_id(arr[i]) = i; in genQuads()78 addSubset(subs[ND_id(w)], u); in genQuads()
35 #define ND_id(n) (((nodeinfo_t*)AGDATA(n))->id) macro
41 #define ND_id(n) (((Agnodeinfo_t*)(n->base.data))->id) macro111 assert(i == ND_id(n));153 ND_id(n) = i++;162 row = ND_id(n);165 J[i] = ND_id(e->head);179 i = ND_id(n);197 i = ND_id(n);278 ND_id(n) = i; in makeDotGraph()292 i = ND_id(n); in makeDotGraph()323 i = ND_id(n); in makeDotGraph()[all …]
64 ND_id(n) = -1; in computeNodeGroups()75 ND_id(n) = nNodeGroups; in computeNodeGroups()82 int index = ND_id(l); in computeNodeGroups()90 ND_id(n) = index; in computeNodeGroups()113 ND_id(l) = nNodeGroups; in computeNodeGroups()114 ND_id(n) = nNodeGroups; in computeNodeGroups()1179 if (myNodeInfo[ND_id(u)].rank == myNodeInfo[ND_id(v)].rank + 1) { in countDummyDiff()1184 if (myNodeInfo[ND_id(v)].rank + 1 < max in countDummyDiff()1186 myNodeInfo[ND_id(v)].rank += 1; in countDummyDiff()1217 ND_id(v) = i; in applyPromotionHeuristic()[all …]
260 ND_id(np) = i++; in scan_graph_mode()270 ND_id(np) = i++; in scan_graph_mode()277 ND_id(np) = i++; in scan_graph_mode()581 m = ND_id(n); in move_node()733 i = ND_id(u); in make_spring()734 j = ND_id(v); in make_spring()
680 i = ND_id(n); in getSizes()690 elabs[nedge_nodes++] = ND_id(n); in getSizes()728 ND_id(n) = i++; in makeMatrix()742 row = ND_id(n); in makeMatrix()745 J[i] = ND_id(aghead(e)); in makeMatrix()794 real* npos = pos + (Ndim * ND_id(n)); in fdpAdjust()811 real *npos = pos + (Ndim * ND_id(n)); in fdpAdjust()
42 assert(ND_id(np) == n_nodes); in extract_adjacency()68 graph->targets[n_edges] = ND_id(target); in extract_adjacency()
690 int i = ND_id(agtail(ep)); in checkEdge()691 int j = ND_id(aghead(ep)); in checkEdge()824 assert(ND_id(np) == i); in makeGraphData()860 *edges++ = ND_id(vp); in makeGraphData()1051 fprintf(stderr, "\"%s\" %d\n", agnameof(v), ND_id(v)); in dumpData()1255 int idx = ND_id(v); in majorization()
31 #define MARK(n) (marks[ND_id(n)])
332 sprintf(buf, "_port_%s_(%d)_(%d)_%ld",agnameof(g), ND_id(t), ND_id(h), in portName()463 ND_id(dn) = id++; in deriveGraph()501 ND_id(dn) = id++; in deriveGraph()560 ND_id(dn) = id++; in deriveGraph()
106 ND_id(n) = i++; in fdp_init_node_edge()
80 i = ND_id(n); in getPos()154 real *npos = pos + (Ndim * ND_id(n)); in sfdpLayout()
489 #define ND_id(n) (((Agnodeinfo_t*)AGDATA(n))->id) macro
173 if (ND_id(u) > ND_id(v)) { in UF_union()