assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
        assertThat(graph.predecessors(node)).isEqualTo(graph.adjacentNodes(node));
        assertThat(graph.successors(node)).isEqualTo(graph.adjacentNodes(node));
        assertThat(graph.inDegree(node)).isEqualTo(graph.degree(node));
        assertThat(graph.outDegree(node)).isEqualTo(graph.degree(node));

/**
 * A node pointer for JXPath to support <code>Xpp3Dom</code>.
 *
 */
class Xpp3DomNodePointer extends NodePointer {

    private XmlNode node;

    Xpp3DomNodePointer(XmlNode node) {
        super(null);
        this.node = node;
    }

    Xpp3DomNodePointer(NodePointer parent, XmlNode node) {
        super(parent);
        this.node = node;
    }

    @Override

        add.forEach((name, node) -> org.merge(name, node, this::merge));
        return org;
    }

    private BuildStep merge(BuildStep node1, BuildStep node2) {
        node1.predecessors.addAll(node2.predecessors);
        node1.successors.addAll(node2.successors);
        node2.mojos.forEach((k, v) -> node1.mojos.merge(k, v, this::mergeMojos));
        return node1;
    }

        this.clock_seq_low = uuid.clock_seq_low;
        this.node = new byte[6];
        this.node[0] = uuid.node[0];
        this.node[1] = uuid.node[1];
        this.node[2] = uuid.node[2];
        this.node[3] = uuid.node[3];
        this.node[4] = uuid.node[4];
        this.node[5] = uuid.node[5];
    }

    /**
     * Construct a UUID from string
     *
     * @param str

        for (Node node = stack.getLast().getFirstChild(); node != null; node = node.getNextSibling()) {
            elements.add((Element) node);
        }
        return elements;
    }

    public void appendChild(String text) {
        appendChild(document.createTextNode(text));
    }

    public void appendChild(Node node) {
        boolean inPara = false;

        clock_seq_hi_and_reserved = uuid.clock_seq_hi_and_reserved;
        clock_seq_low = uuid.clock_seq_low;
        node = new byte[6];
        node[0] = uuid.node[0];
        node[1] = uuid.node[1];
        node[2] = uuid.node[2];
        node[3] = uuid.node[3];
        node[4] = uuid.node[4];
        node[5] = uuid.node[5];
    }

    /**
     * Constructs a UUID from a string representation
     *

      node = root.ceiling(comparator(), endpoint);
      if (node == null) {
        return null;
      }
      if (range.getLowerBoundType() == BoundType.OPEN
          && comparator().compare(endpoint, node.getElement()) == 0) {
        node = node.succ();
      }
    } else {
      node = header.succ();
    }
    return (node == header || !range.contains(node.getElement())) ? null : node;
  }

  /**
   * Remove {@code node} from the set of successors. Returns the value previously associated with
   * the edge connecting the two nodes.
   */
  @CanIgnoreReturnValue
  @Nullable V removeSuccessor(N node);

  /**
   * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it
   * also becomes a successor. Associates {@code value} with the edge connecting the two nodes.
   */

### Node Binaries

filename | sha512 hash
-------- | -----------
[kubernetes-node-linux-amd64.tar.gz](https://dl.k8s.io/v1.21.14/kubernetes-node-linux-amd64.tar.gz) | 35a28acfdbf15265b4d463ecf86cb7bd9c1261fbb2a273d83971e5080050048a4c970dd1daa341c9682d667040ff32be27ec9c6c2e36f51b3d32e673007255d1

            // Node array will be partially filled
            assertEquals((byte) 0xAA, uuid.node[0]);
            assertEquals((byte) 0xBB, uuid.node[1]);
            assertEquals((byte) 0xCC, uuid.node[2]);
            assertEquals((byte) 0xDD, uuid.node[3]);
            assertEquals((byte) 0xEE, uuid.node[4]);
            assertEquals((byte) 0x00, uuid.node[5]); // Missing data defaults to 0
        }