@Override
	public boolean remove(Vertex v) {
		if (v == null) {
			return false;
		}
		int index;
		long key = v.key();
		try {
			if (keyIndices.contains(key)) {
				index = keyIndices.get(key);
				while (firstOutgoingEdge[index] != null) {
					parentGraph.remove(firstOutgoingEdge[index]);
				}
				while (firstIncomingEdge[index] != null) {
					parentGraph.remove(firstIncomingEdge[index]);
				}
				keyIndices.remove(key);
				vertices[index] = null;
				modificationNumber++;
				return true;
			}
		}
		catch (NoValueException e) {
			return false;
		}
		return false;
	}
Removes the given vertex from this vertex set if it contains it. 
@return true if and only if the vertex was sucessfully removed.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/VertexSet.java