dwave-graphs 1.0.0rc1__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (62) hide show
  1. dwave_graphs-1.0.0rc1/LICENSE +176 -0
  2. dwave_graphs-1.0.0rc1/PKG-INFO +102 -0
  3. dwave_graphs-1.0.0rc1/README.rst +77 -0
  4. dwave_graphs-1.0.0rc1/dwave/graphs/__init__.py +26 -0
  5. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/__init__.py +26 -0
  6. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/canonicalization.py +161 -0
  7. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/clique.py +171 -0
  8. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/coloring.py +276 -0
  9. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/cover.py +174 -0
  10. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/elimination_ordering.py +957 -0
  11. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/independent_set.py +193 -0
  12. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/markov.py +146 -0
  13. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/matching.py +129 -0
  14. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/max_cut.py +124 -0
  15. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/partition.py +94 -0
  16. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/social.py +114 -0
  17. dwave_graphs-1.0.0rc1/dwave/graphs/algorithms/tsp.py +119 -0
  18. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/__init__.py +18 -0
  19. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/chimera_layout.py +325 -0
  20. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/distinguishable_colors.py +1026 -0
  21. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/parallel_embeddings.py +250 -0
  22. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/pegasus_layout.py +338 -0
  23. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/qubit_layout.py +489 -0
  24. dwave_graphs-1.0.0rc1/dwave/graphs/drawing/zephyr_layout.py +296 -0
  25. dwave_graphs-1.0.0rc1/dwave/graphs/exceptions.py +22 -0
  26. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/__init__.py +18 -0
  27. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/chimera.py +779 -0
  28. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/common.py +56 -0
  29. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/markov.py +116 -0
  30. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/pegasus.py +1165 -0
  31. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/zephyr/__init__.py +16 -0
  32. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/zephyr/coords.py +202 -0
  33. dwave_graphs-1.0.0rc1/dwave/graphs/topologies/zephyr/graphs.py +633 -0
  34. dwave_graphs-1.0.0rc1/dwave_graphs.egg-info/PKG-INFO +102 -0
  35. dwave_graphs-1.0.0rc1/dwave_graphs.egg-info/SOURCES.txt +60 -0
  36. dwave_graphs-1.0.0rc1/dwave_graphs.egg-info/dependency_links.txt +1 -0
  37. dwave_graphs-1.0.0rc1/dwave_graphs.egg-info/requires.txt +3 -0
  38. dwave_graphs-1.0.0rc1/dwave_graphs.egg-info/top_level.txt +1 -0
  39. dwave_graphs-1.0.0rc1/pyproject.toml +81 -0
  40. dwave_graphs-1.0.0rc1/setup.cfg +4 -0
  41. dwave_graphs-1.0.0rc1/tests/test_canonicalization.py +142 -0
  42. dwave_graphs-1.0.0rc1/tests/test_chimera_layout.py +118 -0
  43. dwave_graphs-1.0.0rc1/tests/test_clique.py +91 -0
  44. dwave_graphs-1.0.0rc1/tests/test_coloring.py +77 -0
  45. dwave_graphs-1.0.0rc1/tests/test_cover.py +76 -0
  46. dwave_graphs-1.0.0rc1/tests/test_elimination_ordering.py +369 -0
  47. dwave_graphs-1.0.0rc1/tests/test_generator_chimera.py +432 -0
  48. dwave_graphs-1.0.0rc1/tests/test_generator_markov.py +28 -0
  49. dwave_graphs-1.0.0rc1/tests/test_generator_pegasus.py +588 -0
  50. dwave_graphs-1.0.0rc1/tests/test_generator_zephyr.py +333 -0
  51. dwave_graphs-1.0.0rc1/tests/test_independent_set.py +90 -0
  52. dwave_graphs-1.0.0rc1/tests/test_markov.py +70 -0
  53. dwave_graphs-1.0.0rc1/tests/test_matching.py +46 -0
  54. dwave_graphs-1.0.0rc1/tests/test_max_cut.py +53 -0
  55. dwave_graphs-1.0.0rc1/tests/test_parallel_embeddings.py +197 -0
  56. dwave_graphs-1.0.0rc1/tests/test_partitioning.py +59 -0
  57. dwave_graphs-1.0.0rc1/tests/test_pegasus_layout.py +136 -0
  58. dwave_graphs-1.0.0rc1/tests/test_qubit_layout.py +65 -0
  59. dwave_graphs-1.0.0rc1/tests/test_regular_coloring.py +60 -0
  60. dwave_graphs-1.0.0rc1/tests/test_social.py +111 -0
  61. dwave_graphs-1.0.0rc1/tests/test_tsp.py +133 -0
  62. dwave_graphs-1.0.0rc1/tests/test_zephyr_layout.py +143 -0
@@ -0,0 +1,176 @@
1
+ Apache License
2
+
3
+ Version 2.0, January 2004
4
+
5
+ http://www.apache.org/licenses/
6
+
7
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
8
+
9
+ 1. Definitions.
10
+
11
+ "License" shall mean the terms and conditions for use, reproduction,
12
+ and distribution as defined by Sections 1 through 9 of this document.
13
+
14
+ "Licensor" shall mean the copyright owner or entity authorized by
15
+ the copyright owner that is granting the License.
16
+
17
+ "Legal Entity" shall mean the union of the acting entity and all
18
+ other entities that control, are controlled by, or are under common
19
+ control with that entity. For the purposes of this definition,
20
+ "control" means (i) the power, direct or indirect, to cause the
21
+ direction or management of such entity, whether by contract or
22
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
23
+ outstanding shares, or (iii) beneficial ownership of such entity.
24
+
25
+ "You" (or "Your") shall mean an individual or Legal Entity
26
+ exercising permissions granted by this License.
27
+
28
+ "Source" form shall mean the preferred form for making modifications,
29
+ including but not limited to software source code, documentation
30
+ source, and configuration files.
31
+
32
+ "Object" form shall mean any form resulting from mechanical
33
+ transformation or translation of a Source form, including but
34
+ not limited to compiled object code, generated documentation,
35
+ and conversions to other media types.
36
+
37
+ "Work" shall mean the work of authorship, whether in Source or
38
+ Object form, made available under the License, as indicated by a
39
+ copyright notice that is included in or attached to the work
40
+ (an example is provided in the Appendix below).
41
+
42
+ "Derivative Works" shall mean any work, whether in Source or Object
43
+ form, that is based on (or derived from) the Work and for which the
44
+ editorial revisions, annotations, elaborations, or other modifications
45
+ represent, as a whole, an original work of authorship. For the purposes
46
+ of this License, Derivative Works shall not include works that remain
47
+ separable from, or merely link (or bind by name) to the interfaces of,
48
+ the Work and Derivative Works thereof.
49
+
50
+ "Contribution" shall mean any work of authorship, including
51
+ the original version of the Work and any modifications or additions
52
+ to that Work or Derivative Works thereof, that is intentionally
53
+ submitted to Licensor for inclusion in the Work by the copyright owner
54
+ or by an individual or Legal Entity authorized to submit on behalf of
55
+ the copyright owner. For the purposes of this definition, "submitted"
56
+ means any form of electronic, verbal, or written communication sent
57
+ to the Licensor or its representatives, including but not limited to
58
+ communication on electronic mailing lists, source code control systems,
59
+ and issue tracking systems that are managed by, or on behalf of, the
60
+ Licensor for the purpose of discussing and improving the Work, but
61
+ excluding communication that is conspicuously marked or otherwise
62
+ designated in writing by the copyright owner as "Not a Contribution."
63
+
64
+ "Contributor" shall mean Licensor and any individual or Legal Entity
65
+ on behalf of whom a Contribution has been received by Licensor and
66
+ subsequently incorporated within the Work.
67
+
68
+ 2. Grant of Copyright License. Subject to the terms and conditions of
69
+ this License, each Contributor hereby grants to You a perpetual,
70
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
71
+ copyright license to reproduce, prepare Derivative Works of,
72
+ publicly display, publicly perform, sublicense, and distribute the
73
+ Work and such Derivative Works in Source or Object form.
74
+
75
+ 3. Grant of Patent License. Subject to the terms and conditions of
76
+ this License, each Contributor hereby grants to You a perpetual,
77
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
78
+ (except as stated in this section) patent license to make, have made,
79
+ use, offer to sell, sell, import, and otherwise transfer the Work,
80
+ where such license applies only to those patent claims licensable
81
+ by such Contributor that are necessarily infringed by their
82
+ Contribution(s) alone or by combination of their Contribution(s)
83
+ with the Work to which such Contribution(s) was submitted. If You
84
+ institute patent litigation against any entity (including a
85
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
86
+ or a Contribution incorporated within the Work constitutes direct
87
+ or contributory patent infringement, then any patent licenses
88
+ granted to You under this License for that Work shall terminate
89
+ as of the date such litigation is filed.
90
+
91
+ 4. Redistribution. You may reproduce and distribute copies of the
92
+ Work or Derivative Works thereof in any medium, with or without
93
+ modifications, and in Source or Object form, provided that You
94
+ meet the following conditions:
95
+
96
+ (a) You must give any other recipients of the Work or
97
+ Derivative Works a copy of this License; and
98
+
99
+ (b) You must cause any modified files to carry prominent notices
100
+ stating that You changed the files; and
101
+
102
+ (c) You must retain, in the Source form of any Derivative Works
103
+ that You distribute, all copyright, patent, trademark, and
104
+ attribution notices from the Source form of the Work,
105
+ excluding those notices that do not pertain to any part of
106
+ the Derivative Works; and
107
+
108
+ (d) If the Work includes a "NOTICE" text file as part of its
109
+ distribution, then any Derivative Works that You distribute must
110
+ include a readable copy of the attribution notices contained
111
+ within such NOTICE file, excluding those notices that do not
112
+ pertain to any part of the Derivative Works, in at least one
113
+ of the following places: within a NOTICE text file distributed
114
+ as part of the Derivative Works; within the Source form or
115
+ documentation, if provided along with the Derivative Works; or,
116
+ within a display generated by the Derivative Works, if and
117
+ wherever such third-party notices normally appear. The contents
118
+ of the NOTICE file are for informational purposes only and
119
+ do not modify the License. You may add Your own attribution
120
+ notices within Derivative Works that You distribute, alongside
121
+ or as an addendum to the NOTICE text from the Work, provided
122
+ that such additional attribution notices cannot be construed
123
+ as modifying the License.
124
+
125
+ You may add Your own copyright statement to Your modifications and
126
+ may provide additional or different license terms and conditions
127
+ for use, reproduction, or distribution of Your modifications, or
128
+ for any such Derivative Works as a whole, provided Your use,
129
+ reproduction, and distribution of the Work otherwise complies with
130
+ the conditions stated in this License.
131
+
132
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
133
+ any Contribution intentionally submitted for inclusion in the Work
134
+ by You to the Licensor shall be under the terms and conditions of
135
+ this License, without any additional terms or conditions.
136
+ Notwithstanding the above, nothing herein shall supersede or modify
137
+ the terms of any separate license agreement you may have executed
138
+ with Licensor regarding such Contributions.
139
+
140
+ 6. Trademarks. This License does not grant permission to use the trade
141
+ names, trademarks, service marks, or product names of the Licensor,
142
+ except as required for reasonable and customary use in describing the
143
+ origin of the Work and reproducing the content of the NOTICE file.
144
+
145
+ 7. Disclaimer of Warranty. Unless required by applicable law or
146
+ agreed to in writing, Licensor provides the Work (and each
147
+ Contributor provides its Contributions) on an "AS IS" BASIS,
148
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
149
+ implied, including, without limitation, any warranties or conditions
150
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
151
+ PARTICULAR PURPOSE. You are solely responsible for determining the
152
+ appropriateness of using or redistributing the Work and assume any
153
+ risks associated with Your exercise of permissions under this License.
154
+
155
+ 8. Limitation of Liability. In no event and under no legal theory,
156
+ whether in tort (including negligence), contract, or otherwise,
157
+ unless required by applicable law (such as deliberate and grossly
158
+ negligent acts) or agreed to in writing, shall any Contributor be
159
+ liable to You for damages, including any direct, indirect, special,
160
+ incidental, or consequential damages of any character arising as a
161
+ result of this License or out of the use or inability to use the
162
+ Work (including but not limited to damages for loss of goodwill,
163
+ work stoppage, computer failure or malfunction, or any and all
164
+ other commercial damages or losses), even if such Contributor
165
+ has been advised of the possibility of such damages.
166
+
167
+ 9. Accepting Warranty or Additional Liability. While redistributing
168
+ the Work or Derivative Works thereof, You may choose to offer,
169
+ and charge a fee for, acceptance of support, warranty, indemnity,
170
+ or other liability obligations and/or rights consistent with this
171
+ License. However, in accepting such obligations, You may act only
172
+ on Your own behalf and on Your sole responsibility, not on behalf
173
+ of any other Contributor, and only if You agree to indemnify,
174
+ defend, and hold each Contributor harmless for any liability
175
+ incurred by, or claims asserted against, such Contributor by reason
176
+ of your accepting any such warranty or additional liability.
@@ -0,0 +1,102 @@
1
+ Metadata-Version: 2.4
2
+ Name: dwave-graphs
3
+ Version: 1.0.0rc1
4
+ Summary: A package providing graphs and algorithms for working with D-Wave quantum computers.
5
+ Author-email: D-Wave <tools@dwavesys.com>
6
+ License-Expression: Apache-2.0
7
+ Project-URL: Changelog, https://github.com/dwavesystems/dwave-graphs/releases
8
+ Project-URL: Documentation, https://docs.dwavequantum.com
9
+ Project-URL: Issues, https://github.com/dwavesystems/dwave-graphs/issues
10
+ Project-URL: Repository, https://github.com/dwavesystems/dwave-graphs.git
11
+ Classifier: Operating System :: OS Independent
12
+ Classifier: Programming Language :: Python :: 3 :: Only
13
+ Classifier: Programming Language :: Python :: 3.10
14
+ Classifier: Programming Language :: Python :: 3.11
15
+ Classifier: Programming Language :: Python :: 3.12
16
+ Classifier: Programming Language :: Python :: 3.13
17
+ Classifier: Programming Language :: Python :: 3.14
18
+ Requires-Python: !=3.14.1,>=3.10
19
+ Description-Content-Type: text/x-rst
20
+ License-File: LICENSE
21
+ Requires-Dist: dimod<0.13,>=0.12.22
22
+ Requires-Dist: networkx<4,>=3.2
23
+ Requires-Dist: numpy<3,>=2
24
+ Dynamic: license-file
25
+
26
+ .. image:: https://img.shields.io/pypi/v/dwave-graphs.svg
27
+ :target: https://pypi.org/project/dwave-graphs
28
+
29
+ .. image:: https://codecov.io/gh/dwavesystems/dwave-graphs/branch/main/graph/badge.svg
30
+ :target: https://codecov.io/gh/dwavesystems/dwave-graphs
31
+
32
+ .. image:: https://circleci.com/gh/dwavesystems/dwave-graphs.svg?style=svg
33
+ :target: https://circleci.com/gh/dwavesystems/dwave-graphs
34
+
35
+ ============
36
+ dwave-graphs
37
+ ============
38
+
39
+ .. start_graphs_about
40
+
41
+ dwave-graphs provides tools for
42
+ working with quantum processing unit (QPU) topology graphs, such as the Pegasus
43
+ used on the Advantage\ :sup:`TM` quantum computer, and implementations of
44
+ graph-theory algorithms on D-Wave quantum computers and other binary quadratic
45
+ model (BQM) samplers.
46
+
47
+ This example generates a Pegasus graph of the size used by Advantage QPUs.
48
+
49
+ >>> import dwave.graphs
50
+ >>> graph = dwave.graphs.pegasus_graph(16)
51
+
52
+ .. end_graphs_about
53
+
54
+ Installation
55
+ ============
56
+
57
+ **Installation from PyPI:**
58
+
59
+ .. code-block:: bash
60
+
61
+ pip install dwave-graphs
62
+
63
+ **Installation from source:**
64
+
65
+ .. code-block:: bash
66
+
67
+ pip install .
68
+
69
+ **Development setup**
70
+
71
+ Install development requirements and the package in editable mode:
72
+
73
+ .. code-block:: bash
74
+
75
+ pip install --group dev
76
+ pip install --editable .
77
+
78
+ Tests require the ``test`` dependency group:
79
+
80
+ .. code-block:: bash
81
+
82
+ pip install --group test
83
+ python -m unittest
84
+
85
+ License
86
+ =======
87
+
88
+ Released under the Apache License 2.0. See LICENSE file.
89
+
90
+ Contributing
91
+ ============
92
+
93
+ Ocean's `contributing guide <https://docs.dwavequantum.com/en/latest/ocean/contribute.html>`_
94
+ has guidelines for contributing to Ocean packages.
95
+
96
+ Release Notes
97
+ -------------
98
+
99
+ We use `reno <https://docs.openstack.org/reno/>`_ to manage release notes.
100
+
101
+ See reno's `user guide <https://docs.openstack.org/reno/latest/user/usage.html>`_
102
+ for details.
@@ -0,0 +1,77 @@
1
+ .. image:: https://img.shields.io/pypi/v/dwave-graphs.svg
2
+ :target: https://pypi.org/project/dwave-graphs
3
+
4
+ .. image:: https://codecov.io/gh/dwavesystems/dwave-graphs/branch/main/graph/badge.svg
5
+ :target: https://codecov.io/gh/dwavesystems/dwave-graphs
6
+
7
+ .. image:: https://circleci.com/gh/dwavesystems/dwave-graphs.svg?style=svg
8
+ :target: https://circleci.com/gh/dwavesystems/dwave-graphs
9
+
10
+ ============
11
+ dwave-graphs
12
+ ============
13
+
14
+ .. start_graphs_about
15
+
16
+ dwave-graphs provides tools for
17
+ working with quantum processing unit (QPU) topology graphs, such as the Pegasus
18
+ used on the Advantage\ :sup:`TM` quantum computer, and implementations of
19
+ graph-theory algorithms on D-Wave quantum computers and other binary quadratic
20
+ model (BQM) samplers.
21
+
22
+ This example generates a Pegasus graph of the size used by Advantage QPUs.
23
+
24
+ >>> import dwave.graphs
25
+ >>> graph = dwave.graphs.pegasus_graph(16)
26
+
27
+ .. end_graphs_about
28
+
29
+ Installation
30
+ ============
31
+
32
+ **Installation from PyPI:**
33
+
34
+ .. code-block:: bash
35
+
36
+ pip install dwave-graphs
37
+
38
+ **Installation from source:**
39
+
40
+ .. code-block:: bash
41
+
42
+ pip install .
43
+
44
+ **Development setup**
45
+
46
+ Install development requirements and the package in editable mode:
47
+
48
+ .. code-block:: bash
49
+
50
+ pip install --group dev
51
+ pip install --editable .
52
+
53
+ Tests require the ``test`` dependency group:
54
+
55
+ .. code-block:: bash
56
+
57
+ pip install --group test
58
+ python -m unittest
59
+
60
+ License
61
+ =======
62
+
63
+ Released under the Apache License 2.0. See LICENSE file.
64
+
65
+ Contributing
66
+ ============
67
+
68
+ Ocean's `contributing guide <https://docs.dwavequantum.com/en/latest/ocean/contribute.html>`_
69
+ has guidelines for contributing to Ocean packages.
70
+
71
+ Release Notes
72
+ -------------
73
+
74
+ We use `reno <https://docs.openstack.org/reno/>`_ to manage release notes.
75
+
76
+ See reno's `user guide <https://docs.openstack.org/reno/latest/user/usage.html>`_
77
+ for details.
@@ -0,0 +1,26 @@
1
+ # Copyright 2018 D-Wave Systems Inc.
2
+ #
3
+ # Licensed under the Apache License, Version 2.0 (the "License");
4
+ # you may not use this file except in compliance with the License.
5
+ # You may obtain a copy of the License at
6
+ #
7
+ # http://www.apache.org/licenses/LICENSE-2.0
8
+ #
9
+ # Unless required by applicable law or agreed to in writing, software
10
+ # distributed under the License is distributed on an "AS IS" BASIS,
11
+ # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ # See the License for the specific language governing permissions and
13
+ # limitations under the License.
14
+
15
+ import dwave.graphs.topologies
16
+ from dwave.graphs.topologies import *
17
+
18
+ import dwave.graphs.algorithms
19
+ from dwave.graphs.algorithms import *
20
+
21
+ from dwave.graphs.exceptions import *
22
+
23
+ import dwave.graphs.drawing
24
+ from dwave.graphs.drawing import *
25
+
26
+ __version__ = "1.0.0rc1"
@@ -0,0 +1,26 @@
1
+ # Copyright 2026 D-Wave
2
+ #
3
+ # Licensed under the Apache License, Version 2.0 (the "License");
4
+ # you may not use this file except in compliance with the License.
5
+ # You may obtain a copy of the License at
6
+ #
7
+ # http://www.apache.org/licenses/LICENSE-2.0
8
+ #
9
+ # Unless required by applicable law or agreed to in writing, software
10
+ # distributed under the License is distributed on an "AS IS" BASIS,
11
+ # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ # See the License for the specific language governing permissions and
13
+ # limitations under the License.
14
+
15
+ from dwave.graphs.algorithms.independent_set import *
16
+ from dwave.graphs.algorithms.canonicalization import *
17
+ from dwave.graphs.algorithms.clique import *
18
+ from dwave.graphs.algorithms.cover import *
19
+ from dwave.graphs.algorithms.matching import *
20
+ from dwave.graphs.algorithms.social import *
21
+ from dwave.graphs.algorithms.elimination_ordering import *
22
+ from dwave.graphs.algorithms.coloring import *
23
+ from dwave.graphs.algorithms.max_cut import *
24
+ from dwave.graphs.algorithms.markov import *
25
+ from dwave.graphs.algorithms.tsp import *
26
+ from dwave.graphs.algorithms.partition import *
@@ -0,0 +1,161 @@
1
+ # Copyright 2018 D-Wave Systems Inc.
2
+ #
3
+ # Licensed under the Apache License, Version 2.0 (the "License");
4
+ # you may not use this file except in compliance with the License.
5
+ # You may obtain a copy of the License at
6
+ #
7
+ # http://www.apache.org/licenses/LICENSE-2.0
8
+ #
9
+ # Unless required by applicable law or agreed to in writing, software
10
+ # distributed under the License is distributed on an "AS IS" BASIS,
11
+ # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ # See the License for the specific language governing permissions and
13
+ # limitations under the License.
14
+
15
+ import math
16
+
17
+ __all__ = ['canonical_chimera_labeling']
18
+
19
+
20
+ def canonical_chimera_labeling(G, t=None):
21
+ """Returns a mapping from the labels of G to chimera-indexed labeling.
22
+
23
+ Parameters
24
+ ----------
25
+ G : NetworkX graph
26
+ A Chimera-structured graph.
27
+ t : int (optional, default 4)
28
+ Size of the shore within each Chimera tile.
29
+
30
+ Returns
31
+ -------
32
+ chimera_indices: dict
33
+ A mapping from the current labels to a 4-tuple of Chimera indices.
34
+
35
+ """
36
+ adj = G.adj
37
+
38
+ if t is None:
39
+ if hasattr(G, 'edges'):
40
+ num_edges = len(G.edges)
41
+ else:
42
+ num_edges = len(G.quadratic)
43
+ t = _chimera_shore_size(adj, num_edges)
44
+
45
+ chimera_indices = {}
46
+
47
+ row = col = 0
48
+
49
+ # need to find a node in a corner
50
+ root_edge = min(((u, v) for u in adj for v in adj[u]),
51
+ key=lambda edge: len(adj[edge[0]]) + len(adj[edge[1]]))
52
+ root, _ = root_edge
53
+
54
+ horiz, verti = rooted_tile(adj, root, t)
55
+ while len(chimera_indices) < len(adj):
56
+
57
+ new_indices = {}
58
+
59
+ if row == 0:
60
+ # if we're in the 0th row, we can assign the horizontal randomly
61
+ for si, v in enumerate(horiz):
62
+ new_indices[v] = (row, col, 0, si)
63
+ else:
64
+ # we need to match the row above
65
+ for v in horiz:
66
+ north = [u for u in adj[v] if u in chimera_indices]
67
+ assert len(north) == 1
68
+ i, j, u, si = chimera_indices[north[0]]
69
+ assert i == row - 1 and j == col and u == 0
70
+ new_indices[v] = (row, col, 0, si)
71
+
72
+ if col == 0:
73
+ # if we're in the 0th col, we can assign the vertical randomly
74
+ for si, v in enumerate(verti):
75
+ new_indices[v] = (row, col, 1, si)
76
+ else:
77
+ # we need to match the column to the east
78
+ for v in verti:
79
+ east = [u for u in adj[v] if u in chimera_indices]
80
+ assert len(east) == 1
81
+ i, j, u, si = chimera_indices[east[0]]
82
+ assert i == row and j == col - 1 and u == 1
83
+ new_indices[v] = (row, col, 1, si)
84
+
85
+ chimera_indices.update(new_indices)
86
+
87
+ # get the next root
88
+ root_neighbours = [v for v in adj[root] if v not in chimera_indices]
89
+ if len(root_neighbours) == 1:
90
+ # we can increment the row
91
+ root = root_neighbours[0]
92
+ horiz, verti = rooted_tile(adj, root, t)
93
+
94
+ row += 1
95
+ else:
96
+ # need to go back to row 0, and increment the column
97
+ assert not root_neighbours # should be empty
98
+
99
+ # we want (0, col, 1, 0), we could cache this, but for now let's just go look for it
100
+ # the slow way
101
+ vert_root = [v for v in chimera_indices if chimera_indices[v] == (0, col, 1, 0)][0]
102
+
103
+ vert_root_neighbours = [v for v in adj[vert_root] if v not in chimera_indices]
104
+
105
+ if vert_root_neighbours:
106
+
107
+ verti, horiz = rooted_tile(adj, vert_root_neighbours[0], t)
108
+ root = next(iter(horiz))
109
+
110
+ row = 0
111
+ col += 1
112
+
113
+ return chimera_indices
114
+
115
+
116
+ def rooted_tile(adj, n, t):
117
+ horiz = {n}
118
+ vert = set()
119
+
120
+ # get all of the nodes that are two steps away from n
121
+ two_steps = {v for u in adj[n] for v in adj[u] if v != n}
122
+
123
+ # find the subset of two_steps that share exactly t neighbours
124
+ for v in two_steps:
125
+ shared = set(adj[n]).intersection(adj[v])
126
+
127
+ if len(shared) == t:
128
+ assert v not in horiz
129
+ horiz.add(v)
130
+ vert |= shared
131
+
132
+ assert len(vert) == t
133
+ return horiz, vert
134
+
135
+
136
+ def _chimera_shore_size(adj, num_edges):
137
+ # we know |E| = m*n*t*t + (2*m*n-m-n)*t
138
+
139
+ num_nodes = len(adj)
140
+
141
+ max_degree = max(len(adj[v]) for v in adj)
142
+
143
+ if num_nodes == 2 * max_degree:
144
+ return max_degree
145
+
146
+ def a(t):
147
+ return -2*t
148
+
149
+ def b(t):
150
+ return (t + 2) * num_nodes - 2 * num_edges
151
+
152
+ def c(t):
153
+ return -num_nodes
154
+
155
+ t = max_degree - 1
156
+ m = (-b(t) + math.sqrt(b(t)**2 - 4*a(t)*c(t))) / (2 * a(t))
157
+
158
+ if m.is_integer():
159
+ return t
160
+
161
+ return max_degree - 2