Add NrSpanningTrees attribute #224
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…placianMatrix and NrSpanningTrees attributes.
james-d-mitchell
added
merge-in-to-master
james-d-mitchell
approved these changes
Jul 22, 2019
There was a problem hiding this comment.
This looks good to me! Thanks a lot @reiniscirpons, this is super useful!
|
Any comments @wilfwilson before merging? |
|
No comments, except thanks. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds the following attributes
DegreeMatrix- for a digraph, returns the diagonal matrix whoseith diagonal entry is the outdegree of vertexi.LaplacianMatrix- for a digraph, returns the difference of theDegreeMatrixandAdjacencyMatrixof the digraph.NrSpanningTrees- for a symmetric digraph, returns the number of spanning trees of that digraph. Calculated by computing the determinant ofLaplacianMatrixwith a single row and column removed. Time complexityO(n^3).See Issue #197.