-
-
Notifications
You must be signed in to change notification settings - Fork 482
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
Graph.{[weighted_]adjacency_matrix,kirchhoff_matrix}
: Support constructing End(CombinatorialFreeModule)
elements
#37955
Conversation
…g nrows, keyword row_keys; fix documentation
…w method _vertices_keys
Hom(CombinatorialFreeModule)
elementsGraph.{[weighted_]adjacency_matrix,kirchhoff_matrix}
: Support constructing Hom(CombinatorialFreeModule)
elements
Documentation preview for this PR (built with commit 98323cb; changes) is ready! 🎉 |
Graph.{[weighted_]adjacency_matrix,kirchhoff_matrix}
: Support constructing Hom(CombinatorialFreeModule)
elementsGraph.{[weighted_]adjacency_matrix,kirchhoff_matrix}
: Support constructing End(CombinatorialFreeModule)
elements
def _vertex_indices_and_keys(self, vertices=None, *, sort=None): | ||
r""" | ||
Process a ``vertices`` parameter. | ||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
May be you could add that this is a helper function for methods like adjacency_matrix
, kirchhoff_matrix
, etc.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Good idea, done in 98323cb
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM.
I assume that if needed we can change the name of the new method. I don't have better option in mind.
Thank you! |
…x}`: Support constructing `End(CombinatorialFreeModule)` elements <!-- ^ Please provide a concise and informative title. --> <!-- ^ 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. --> <!-- v Why is this change required? What problem does it solve? --> <!-- v If this PR resolves an open issue, please link to it here. For example, "Fixes sagemath#12345". --> This is a follow-up after - sagemath#37692 ... to cover a few more methods. The methods can now create endomorphisms of free modules whose bases are indexed by the vertices. To help with this, we make the `matrix` constructor a bit more flexible. This is also preparation for making the spectral graph theory methods ready for `CombinatorialFreeModule`: - sagemath#37943 ### 📝 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. - [ ] I have created tests covering the changes. - [ ] I have updated the documentation and checked the documentation preview. ### ⌛ Dependencies <!-- List all open PRs that this PR logically depends on. For example, --> <!-- - sagemath#12345: short description why this is a dependency --> <!-- - sagemath#34567: ... --> URL: sagemath#37955 Reported by: Matthias Köppe Reviewer(s): David Coudert, Matthias Köppe
…x}`: Support constructing `End(CombinatorialFreeModule)` elements <!-- ^ Please provide a concise and informative title. --> <!-- ^ 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. --> <!-- v Why is this change required? What problem does it solve? --> <!-- v If this PR resolves an open issue, please link to it here. For example, "Fixes sagemath#12345". --> This is a follow-up after - sagemath#37692 ... to cover a few more methods. The methods can now create endomorphisms of free modules whose bases are indexed by the vertices. To help with this, we make the `matrix` constructor a bit more flexible. This is also preparation for making the spectral graph theory methods ready for `CombinatorialFreeModule`: - sagemath#37943 ### 📝 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. - [ ] I have created tests covering the changes. - [ ] I have updated the documentation and checked the documentation preview. ### ⌛ Dependencies <!-- List all open PRs that this PR logically depends on. For example, --> <!-- - sagemath#12345: short description why this is a dependency --> <!-- - sagemath#34567: ... --> URL: sagemath#37955 Reported by: Matthias Köppe Reviewer(s): David Coudert, Matthias Köppe
This is a follow-up after
matrix
,Graph.incidence_matrix
,LinearMatroid.representation
: Support constructingHom(CombinatorialFreeModule)
elements #37692... to cover a few more methods. The methods can now create endomorphisms of free modules whose bases are indexed by the vertices. To help with this, we make the
matrix
constructor a bit more flexible.This is also preparation for making the spectral graph theory methods ready for
CombinatorialFreeModule
:ModulesWithBasis
: Add methodseigenvalues
,eigenvectors
,eigenspaces
to endomorphisms #37943📝 Checklist
⌛ Dependencies