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).
Thank you.
Revision history [back]
 | 1 | initial version |
Code for deleting edges of a subgraph
Code for deleting edges of a subgraph
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)
Thank you.
Code for deleting edges of a subgraph
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)
Thank you.
Code for deleting the edges of a subgraph
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.
