Skip to content

Overwrote methods concerning subdivision of edges in a matching covered graph #39650

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 19 commits into from

Conversation

janmenjayap
Copy link
Contributor

@janmenjayap janmenjayap commented Mar 8, 2025

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.

Copy link

github-actions bot commented Mar 8, 2025

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

@janmenjayap janmenjayap changed the title Implemented methods concerning subdivision of edges in a matching covered graph Overwrote methods concerning subdivision of edges in a matching covered graph Mar 9, 2025
@janmenjayap
Copy link
Contributor Author

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.

Copy link
Contributor

@dcoudert dcoudert left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM.

@janmenjayap
Copy link
Contributor Author

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
Copy link
Contributor

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

@dcoudert
Copy link
Contributor

Your branch contains a commit that has been (unexpectedly) removed when going from 10.6.rc1 to 10.6. Can you restart your branch from a fresh develop branch of 10.7.beta0.

@janmenjayap
Copy link
Contributor Author

Hi @dcoudert,
We may please close this PR (and delete this branch) and start a discussion at #40090 as a continuation of the same.

@janmenjayap janmenjayap deleted the edge_subdivision branch May 13, 2025 20:29
vbraun pushed a commit to vbraun/sage that referenced this pull request Jul 18, 2025
sagemathgh-40090: Overwrote methods concerning subdivision of edge(s) in a matching covered graph
    
<!-- ^ Please provide a concise and informative title. -->
The objective of this issue is to overwrite the methods pertaining to
subdivision of edges in a matching covered graph.

<!-- ^ Don't put issue numbers in the title, do this in the PR
description below. -->
<!-- ^ For example, instead of "Fixes sagemath#12345" use "Introduce new method
to calculate 1 + 2". -->
<!-- v Describe your changes below in detail. -->
More specifically, this PR aims to overwrite the following methods:
- [x]  `subdivide_edge()` | Subdivide an edge `k` times.
- [x]  `subdivide_edges()` | Subdivide `k` times edges from an iterable
container.

<!-- v Why is this change required? What problem does it solve? -->
This PR shall address the methods related to subdivision of edge(s) in
matching covered graphs.

<!-- v If this PR resolves an open issue, please link to it here. For
example, "Fixes sagemath#12345". -->
Fixes sagemath#38216.
Note that this issue fixes a small part of the mentioned issue.

This issue is the fresh restart of the issue sagemath#39650.

### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->

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

### ⌛ Dependencies
Nothing as of now.

<!-- List all open PRs that this PR logically depends on. For example,
-->
<!-- - sagemath#12345: short description why this is a dependency -->
<!-- - sagemath#34567: ... -->

cc: @dcoudert.
    
URL: sagemath#40090
Reported by: Janmenjaya Panda
Reviewer(s): David Coudert, Janmenjaya Panda
vbraun pushed a commit to vbraun/sage that referenced this pull request Jul 20, 2025
sagemathgh-40090: Overwrote methods concerning subdivision of edge(s) in a matching covered graph
    
<!-- ^ Please provide a concise and informative title. -->
The objective of this issue is to overwrite the methods pertaining to
subdivision of edges in a matching covered graph.

<!-- ^ Don't put issue numbers in the title, do this in the PR
description below. -->
<!-- ^ For example, instead of "Fixes sagemath#12345" use "Introduce new method
to calculate 1 + 2". -->
<!-- v Describe your changes below in detail. -->
More specifically, this PR aims to overwrite the following methods:
- [x]  `subdivide_edge()` | Subdivide an edge `k` times.
- [x]  `subdivide_edges()` | Subdivide `k` times edges from an iterable
container.

<!-- v Why is this change required? What problem does it solve? -->
This PR shall address the methods related to subdivision of edge(s) in
matching covered graphs.

<!-- v If this PR resolves an open issue, please link to it here. For
example, "Fixes sagemath#12345". -->
Fixes sagemath#38216.
Note that this issue fixes a small part of the mentioned issue.

This issue is the fresh restart of the issue sagemath#39650.

### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->

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

### ⌛ Dependencies
Nothing as of now.

<!-- List all open PRs that this PR logically depends on. For example,
-->
<!-- - sagemath#12345: short description why this is a dependency -->
<!-- - sagemath#34567: ... -->

cc: @dcoudert.
    
URL: sagemath#40090
Reported by: Janmenjaya Panda
Reviewer(s): David Coudert, Janmenjaya Panda
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

On Decompositions, Generation Methods and related concepts in the theory of Matching Covered Graphs
2 participants