The number of arcs in this graph.

var g = new HashDigraph[Int]
g.add_arc(0, 1)
assert g.num_arcs == 1
g.add_arc(0, 1)
assert g.num_arcs == 1
g.add_arc(2, 3)
assert g.num_arcs == 2

Property definitions

graph $ Digraph :: num_arcs
	# The number of arcs in this graph.
	#
	# ~~~
	# var g = new HashDigraph[Int]
	# g.add_arc(0, 1)
	# assert g.num_arcs == 1
	# g.add_arc(0, 1)
	# assert g.num_arcs == 1
	# g.add_arc(2, 3)
	# assert g.num_arcs == 2
	# ~~~
	fun num_arcs: Int is abstract
lib/graph/digraph.nit:162,2--173,30

graph $ HashDigraph :: num_arcs
	redef fun num_arcs do return number_of_arcs end
lib/graph/digraph.nit:951,2--48