delta/python-packages/networkx.git/doc/reference/algorithms/graph_hashing.rst, branch main github.com: networkx/networkx.git Add weisfeiler lehman subgraph hashing (#4946) 2021-09-12T15:09:41+00:00 Aaron Z 40212329+aaronzo@users.noreply.github.com 2021-09-12T15:09:41+00:00 fea134b710ef2e9636428a868022e1aae6937e78 * weisfeiler lehman subgraph hashing * address PR comments: restructure tests and improvements to hashing logic * slight speedup initialising node attribute labels * docstring changes based on pr comments * improved subgraph description and fixed a bug where edge directions are disregarded for isomorphism. Added tests for this case * Added warning on hash changes to release_dev.rst * Touch up release note. * Fix sphinx warning about underline lengths. Co-authored-by: Aaron Zolnai Lucas <aaronzolnailucas@quantexa.com> Co-authored-by: Ross Barnowski <rossbar@berkeley.edu> 
* weisfeiler lehman subgraph hashing

* address PR comments: restructure tests and improvements to hashing logic

* slight speedup initialising node attribute labels

* docstring changes based on pr comments

* improved subgraph description and fixed a bug where edge directions are disregarded for isomorphism.
 Added tests for this case

* Added warning on hash changes to release_dev.rst

* Touch up release note.

* Fix sphinx warning about underline lengths.

Co-authored-by: Aaron Zolnai Lucas <aaronzolnailucas@quantexa.com>
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
 Remove trailing spaces 2020-07-10T16:34:39+00:00 Jarrod Millman jarrod.millman@gmail.com 2020-07-10T04:59:19+00:00 cea08c3bb8ca5aa2e167d534b0c5629205733762 






ENH: Add new graph_hashing feature
2020-07-07T20:13:08+00:00

Carlos G. Oliver
carlos.gonzalez.oliver@gmail.com

2020-07-07T20:13:08+00:00

167b47f784626c3b45a3802c84f681c649c9757b

Adds graph_hashing module containing the Weisfeiler Lehman
algorithm for hashing graphs.

Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>




Adds graph_hashing module containing the Weisfeiler Lehman
algorithm for hashing graphs.

Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>