Overwrote methods concerning subdivision of edges in a matching covered graph

[janmenjayap]

The objective of this issue is to overwrite the methods pertaining to subdivision of edges in a matching covered graph.

More specifically, this PR aims to overwrite the following methods:

• subdivide_edge() | Subdivide an edge k times.
• subdivide_edges() | Subdivide k times edges from an iterable container.

This PR shall address the methods related to subdivision of edge(s) in matching covered graphs.

Fixes #38216.
Note that this issue fixes a small part of the mentioned issue.

📝 Checklist

• The title is concise and informative.
• The description explains in detail what this PR is about.
• I have linked a relevant issue or discussion.
• I have created tests covering the changes.
• I have updated the documentation and checked the documentation preview.

⌛ Dependencies

Nothing as of now.

cc: @dcoudert.

[github-actions]

Documentation preview for this PR (built with commit e9c81d3; changes) is ready! 🎉
This preview will update shortly after each push to this PR.

[janmenjayap]

Hi,
I have added the case if the arguments are provided like to subdivide the four edges, each of which is, (0, 1, None), but the graph has at most 3 of it, it shall throw a ValueError.

[dcoudert]

LGTM.

[janmenjayap]

Hi @dcoudert,
It seems like there are lines which have not been covered by doctests.

Could you please set it back to needs work?
Thank you.

[dcoudert]

It was already back to needs review when you rebased on rc1.