Add Dijkstra shortest path functions #162
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
This commit adds a new method to the PyDiGraph class, to_undirected(), which will generate an undirected PyGraph object from the PyDiGraph object. Fixes Qiskit#153
This commit adds 2 new functions, digraph_dijkstra_shortest_paths() and graph_dijkstra_shortest_path(), which is a function to get the shortest path from a node in a graph. It leverages the same dijkstra's algorithm module which has been modified to get a path in addition to the path length. Depends on Qiskit#161 Fixes Qiskit#151
mtreinish
added a commit
to mtreinish/qiskit-core
that referenced
this pull request
Oct 5, 2020
This commit migrates Terra's CouplingMap class to us retworkx internally instead of networkx providing >10x speed improvement for CouplingMap operations. Requires: Qiskit/rustworkx#157 Qiskit/rustworkx#156 Qiskit/rustworkx#144 Qiskit/rustworkx#143 Qiskit/rustworkx#147 Qiskit/rustworkx#158 Qiskit/rustworkx#162 Qiskit/rustworkx#161 all be applied to the retworkx version installed.
9 tasks
Pull Request Test Coverage Report for Build 354557157
💛 - Coveralls |
|
Now that #161 has merged this is unblocked, so removing the on hold label. |
This commit fixes an issue with duplicate weight_callable functions that happened because one was added in this PR's branch and another was added in a different PR. The functions were mostly identical so this just consolidates the 2.
7 tasks
lcapelluto
reviewed
Nov 9, 2020
Co-authored-by: Lauren Capelluto <laurencapelluto@gmail.com>
lcapelluto
approved these changes
Nov 9, 2020
mergify bot
added a commit
to Qiskit/qiskit
that referenced
this pull request
Dec 4, 2020
* WIP: Use retworkx for CouplingMap This commit migrates Terra's CouplingMap class to us retworkx internally instead of networkx providing >10x speed improvement for CouplingMap operations. Requires: Qiskit/rustworkx#157 Qiskit/rustworkx#156 Qiskit/rustworkx#144 Qiskit/rustworkx#143 Qiskit/rustworkx#147 Qiskit/rustworkx#158 Qiskit/rustworkx#162 Qiskit/rustworkx#161 all be applied to the retworkx version installed. * DNM: Install retworkx from source * DNM: Add retworkx custom branch to travis * Fix draw() copy paste error * Fix typo * DNK: Add source retworkx to docs build * Fix lint * Use graph_distance_matrix instead of floyd warshall * DNM also add retworkx from source for image test job * Use Gnm random function from retworkx in token swapper tests * Remove nx import from token swapper tests * Fix lint * Remove install from git from CI config since retworkx 0.6.0 is released * Fix api call * Use retworkx generators where possible for constructors * Remvoe source install from travis config * Bump version in setup.py too * Use extend_from_edge_list for from_full * Update qiskit/transpiler/coupling.py * Use edge_list() return and has_edge() in sabre In Qiskit/rustworkx#204 the return type of the edge_list() method will be returned as a custom sequence type the defer the type conversion from rust to python. So casting to a list no longer will be a no-op after that point so this commit removes the cast. At the same time in the sabre swap pass one of the bottlenecks at large qubit counts is traversing that edge list looking for edges, this updates that to use the has_edge() method which should be faster than a full list traversal every iteration. * Fix issue in layout_transformation pass In #5281 the layout transformation pass was updated to handle the case where the coupling map was not defined. In those cases for the purposes of the layout transformation it treats the coupling map as being fully connected. So it creates a new full coupling map to use for the token swapper. However, it neglects that the token swapper expects an undirected graph and was passing in a directed graph. This didn't matter too much for the networkx based coupling map object because networkx can handle directed or undirected in the same function. But, for retworkx directed graphs and undirected graphs are different types an can't be used interchangeably. This commit fixes this issue in that pass. * Update qiskit/transpiler/passes/routing/algorithms/token_swapper.py Co-authored-by: Julien Gacon <gaconju@gmail.com> * Fix Lint Co-authored-by: Julien Gacon <gaconju@gmail.com> Co-authored-by: Kevin Krsulich <kevin.krsulich@ibm.com> Co-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>
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 commit adds 2 new functions, digraph_dijkstra_shortest_paths() and
graph_dijkstra_shortest_path(), which is a function to get the shortest
path from a node in a graph. It leverages the same dijkstra's algorithm
module which has been modified to get a path in addition to the path
length.
Depends on #161
Fixes #151