Lines Matching refs:stack
40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
45 * their neighbors. Because they were pushed on the stack only when
566 g->tmp.stack = reralloc(g, g->tmp.stack, unsigned int, alloc);
698 g->tmp.stack[g->tmp.stack_count] = n;
708 * trivially-colorable nodes into a stack of nodes to be colored,
711 * If we encounter a case where we can't push any nodes on the stack, then
712 * we optimistically choose a node and push it on the stack. We heuristically
763 * stack. This also means that we're guaranteed to make progress
783 * one of these nodes to the stack. It needs to be
838 /* If our adjacent node is in the stack, it's not allocated yet. */
892 * Pops nodes from the stack back into the graph, coloring them with
910 int n = g->tmp.stack[g->tmp.stack_count - 1];
962 * the way that the previous nodes popped off the stack are laid out.
999 * input data). These nodes do not end up in the stack during
1001 * the first popped off the stack and assigned their fixed locations.