Returns true if and only if u exists in this graph.

var g = new HashDigraph[Int]
g.add_vertex(1)
assert g.has_vertex(1)
assert not g.has_vertex(0)
g.add_vertex(1)
assert g.has_vertex(1)
assert not g.has_vertex(0)

Property definitions

graph $ Digraph :: has_vertex
	# Returns true if and only if `u` exists in this graph.
	#
	# ~~~
	# var g = new HashDigraph[Int]
	# g.add_vertex(1)
	# assert g.has_vertex(1)
	# assert not g.has_vertex(0)
	# g.add_vertex(1)
	# assert g.has_vertex(1)
	# assert not g.has_vertex(0)
	# ~~~
	fun has_vertex(u: V): Bool is abstract
lib/graph/digraph.nit:175,2--186,39

graph $ HashDigraph :: has_vertex
	redef fun has_vertex(u) do return outgoing_vertices_map.keys.has(u)
lib/graph/digraph.nit:961,2--68