EdgeDelete
EdgeDelete[g,e]
makes a graph by deleting the edge e from the graph g.
EdgeDelete[g,{e1,e2,…}]
deletes a collection of edges from g.
EdgeDelete[g,patt]
deletes all edges that match the pattern patt.
EdgeDelete[{vw,…},…]
uses rules vw to specify the graph g.
Details and Options
- EdgeDelete is also known as edge removal or edge deletion.
- EdgeDelete[g,e] will delete the edge e only if it is present in g.
- An undirected edge can be specified using vw or UndirectedEdge[v,w].
- A directed edge can be specified using vw or DirectedEdge[v,w].
- EdgeDelete works with undirected graphs, directed graphs, multigraphs and mixed graphs.
Examples
open allclose allScope (8)
EdgeDelete works with undirected graphs:
Delete a set of edges from the graph:
Use rules to specify the graph:
Use a pattern to delete a subset of edges:
EdgeDelete works with large graphs:
Text
Wolfram Research (2010), EdgeDelete, Wolfram Language function, https://reference.wolfram.com/language/ref/EdgeDelete.html (updated 2015).
CMS
Wolfram Language. 2010. "EdgeDelete." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/EdgeDelete.html.
APA
Wolfram Language. (2010). EdgeDelete. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/EdgeDelete.html