-
Notifications
You must be signed in to change notification settings - Fork 107
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
Isomorphism tutorial #83
Conversation
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.
This looks good @paulitapb! I went through the notebook once and have put in some comments.
I went through all the formatting and now this notebook is finished. @MridulS |
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.
Made some subjective changes.
Co-authored-by: Mridul Seth <[email protected]>
Co-authored-by: Mridul Seth <[email protected]>
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.
Thanks for this @paulitapb , very nice work! There are certainly a few things that we could continue touching up, but let's leave them for follow-up PRs.
- k-Contractible graphs (a generalization of bounded degree and bounded genus) | ||
|
||
|
||
Let's see an example, we can use the function *tree_isomorphism()* from the isomorphism module to check if two trees are isomorphic in $O(n*log(n))$. This function uses a D&C approach to match the trees once it has found the root of each tree and returns a list with the node matching. |
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.
I've never heard of D&C approach
- we should probably more explicitly state what this means!
Add a high-level notebook introducing isomorphism and the related functionality in NetworkX Co-authored-by: Mridul Seth <[email protected]> Co-authored-by: Ross Barnowski <[email protected]> Co-authored-by: Mridul Seth <[email protected]>
* Standardize * Update sudoku.md * Changed links back to old form * change versions back to original * add back ipykernel * clean up, make pre-commit happy * make pre-commit happy * Fix typo. * Rm unnecessary warnings filter. * Fix footnote format. * Condense heading. * More canonical way to create DiGraph. * Condense headings. * Fix header level in flow. * Typo. * Fix heading level. * More heading fixes. * Resolved suggestions * MAINT: changing white text logo to gray banner (#105) * Isomorphism tutorial (#83) Add a high-level notebook introducing isomorphism and the related functionality in NetworkX Co-authored-by: Mridul Seth <[email protected]> Co-authored-by: Ross Barnowski <[email protected]> Co-authored-by: Mridul Seth <[email protected]> * Add Python 3.11 to the CI. (#107) * Rm colab cruft. (#106) * created and then removed traversal notebook draft 1 * try converting with jupytext for tests again * test all notebooks except the long exploratory ones * restore the python versions field in tests * Fixup missing ref in Dinitz nb. --------- Co-authored-by: Ross Barnowski <[email protected]> Co-authored-by: Mridul Seth <[email protected]> Co-authored-by: Dan Schult <[email protected]>
This is just an initial draft of the notebook. There are still some TODOs that I have to solve and plenty of things to knit and add. I just wanted to share my progress.