graph :: MutableDigraph :: remove_arc
(u,v) from this graph.If the arc does not exist in the graph, then nothing happens.
var g = new HashDigraph[Int]
g.add_arc(0, 1)
assert g.num_arcs == 1
g.remove_arc(0, 1)
assert g.num_arcs == 0
g.remove_arc(0, 1)
assert g.num_arcs == 0
# Removes the arc `(u,v)` from this graph.
#
# If the arc does not exist in the graph, then nothing happens.
#
# ~~~
# var g = new HashDigraph[Int]
# g.add_arc(0, 1)
# assert g.num_arcs == 1
# g.remove_arc(0, 1)
# assert g.num_arcs == 0
# g.remove_arc(0, 1)
# assert g.num_arcs == 0
# ~~~
fun remove_arc(u, v: V) is abstract
lib/graph/digraph.nit:766,2--779,36
redef fun remove_arc(u, v)
do
if has_arc(u, v) then
outgoing_vertices_map[u].remove(v)
incoming_vertices_map[v].remove(u)
number_of_arcs -= 1
end
end
lib/graph/digraph.nit:994,2--1001,4