public int outValence(Vertex v) {
		int outv = 0;
		Edge e = vertices.getFirstOutgoingEdge(v);
		while (e != null) {
			outv++;
			e = edges.getNextEdgeWithSameFrom(e);
		}
		return outv;
	}
The number of edges having v as their initial or
 "from" vertex.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DirectedGraph.java