graph :: Digraph :: out_degree
u
.var g = new HashDigraph[Int]
g.add_arc(1, 2)
g.add_arc(1, 3)
g.add_arc(2, 3)
assert g.out_degree(3) == 0
assert g.out_degree(1) == 2
# Returns the number of arcs whose source is `u`.
#
# ~~~
# var g = new HashDigraph[Int]
# g.add_arc(1, 2)
# g.add_arc(1, 3)
# g.add_arc(2, 3)
# assert g.out_degree(3) == 0
# assert g.out_degree(1) == 2
# ~~~
fun out_degree(u: V): Int do return successors(u).length
lib/graph/digraph.nit:412,2--422,57