Network::delEdge -- deletes one
or several edges from a network
IntroductionNetwork::delEdge(G, e) deletes edge
e from network G.
Call(s)Network::delEdge(G, e)
Network::delEdge(G, l)
Parametersl |
- | a list of edges |
e |
- | an edge |
G |
- | a network |
Returnsthe new network
DetailsNetwork::delEdge deletes one or several edges from a
network. An edge is represented by a list containing two nodes of the
network. An error is raised if the specified edge is not contained in
the network.Network::delEdge(G, e) deletes the edge
e from the network G.Network::delEdge(G, l) deletes all edges
in the list l from the network G.
Example
1Deleting an edge from a cyclic network results in a (degenerated) tree.
>> N1 := Network::cycle([v1,v2,v3]): Network::printGraph(N1)
Vertices: [v1, v2, v3]
Edges: [[v1, v2], [v2, v3], [v3, v1]]
Vertex weights: table(v3=0,v2=0,v1=0)
Edge capacities: table([v3, v1]=1,[v2, v3]=1,[v1, v2]=1)
Edge weights: table([v3, v1]=1,[v2, v3]=1,[v1, v2]=1)
Adjacency list (out): table(v3=[v1],v2=[v3],v1=[v2])
Adjacency list (in): table(v3=[v2],v2=[v1],v1=[v3])
>> N2 := Network::delEdge(N1, [v2,v3]): Network::printGraph(N2)
Vertices: [v1, v2, v3]
Edges: [[v1, v2], [v3, v1]]
Vertex weights: table(v3=0,v2=0,v1=0)
Edge capacities: table([v3, v1]=1,[v1, v2]=1)
Edge weights: table([v3, v1]=1,[v1, v2]=1)
Adjacency list (out): table(v3=[v1],v2=[],v1=[v2])
Adjacency list (in): table(v3=[],v2=[v1],v1=[v3])
Network::DelEdge