In a directed graph, we define the degree out of a vertex or the "out-degree" of a vertex to be the number of children of that vertex. Intuitively, this give the number of edges pointing out of a vertex to another vertex.
i1 : D = digraph({1,2,3,4},{{1,2},{2,3},{3,4},{4,2}}); |
i2 : degreeOut(D, 2) o2 = 1 |
The object degreeOut is a method function.