deletes all the arcs or edges between a set of nodes
g1 = delete_edges(ij,g)
matrix of integers (number of nodes)
graph data structure of the new graph without the arcs or edges defined by ij
If g
is a directed graph,
delete_edges
returns the graph g1
with the arcs defined by matrix ij
being deleted.
ij
must be a n x 2 matrix of node numbers: the
n
edges to be deleted are defined by couples of nodes
(ij(i,1)
, ij(i,2)
).
If g
is an undirected graph, the edges
corresponding to matrix ij
are deleted.
delete_edges
and delete_arcs
define the same function