When I have a graph $G$ and a perfect matching given by G.matching() or by using the independent set in its line graph, I wish to know whether there is a method to delete the matching edges from the edge set of the graph. Like, I want to know a method that gives $G-M1$ for $M1$ being a matching in the graph. Is there any such method? Thanks beforehand..
Revision history [back]
 | 1 | initial version |
