(u,v)
is an arc in this graph.var g = new HashDigraph[Int]
g.add_arc(0, 1)
g.add_arc(1, 2)
assert g.has_arc(0, 1)
assert g.has_arc(1, 2)
assert not g.has_arc(0, 2)
redef fun has_arc(u, v)
do
return outgoing_vertices_map[u].has(v)
end
lib/graph/digraph.nit:989,2--992,4
# Is (u,v) an arc in this graph?
# If `u` is the same as `v` return true
#
# ~~~
# var g = new ReflexiveHashDigraph[Int]
# g.add_arc(1, 2)
# g.add_arc(3, 1)
# g.add_vertex(4)
# assert g.has_arc(1,1)
# assert g.has_arc(2,2)
# assert g.has_arc(2,2)
# assert g.has_arc(3,2) == false
# assert g.has_arc(4,4)
# ~~~
redef fun has_arc(u, v)
do
return u == v or super
end
lib/graph/digraph.nit:1049,2--1066,4