Hi all,
I have as inputs a simple graph G and a subgraph H. I want as output the graph G-H, defined as the graph obtained from G by removing the edges of H (without removing any vertices).
H is given like this: H=G.random_subgraph(.25)
Is there a command like G.delete_edges(H) that returns the desired graph?
Thank you.
sage: G = Graph([(1,2),(2,3),(3,4),(4,5)])
sage: H = Graph([(1,2),(4,5)])
sage: G_minus_H = G.copy()
sage: G_minus_H.delete_edges(H.edges())
sage: G_minus_H.vertices()
[1, 2, 3, 4, 5]
sage: G_minus_H.edges(labels=False)
[(2, 3), (3, 4)]Thank you so much!
Asked: 2 years ago
Seen: 244 times
Last updated: Sep 27 '22
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
Is this a homework assignment?
No, personal interest. I used sage for graph theory once years ago, now I'm starting to use it again, don't know much.