You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The original paper (http://www.cs.kent.edu/~dragan/GraphAn/CycleBasis/p514-paton.pdf) which we implement returns a set of nodes instead a set of edges. #505 pointed out that returning a set of edges is more useful in many cases. The expected enhancement is to have a method for each such that users can get a cycle basis both with nodes and with edges.
The text was updated successfully, but these errors were encountered:
This should be fairly straightforward to implement, without needing to refer to a paper for guidance. The idea is to create a spanning tree through graph traversal, then let each non-tree edge induce a cycle in the tree. The key is to do the graph traversal in terms of edges rather than vertices. Then multi-edges won't be a problem.
What is the expected enhancement?
Create an equivalent of the
retworkx.cycle_basis
method but returning edges instead of nodes.https://github.com/Qiskit/retworkx/blob/5b90ee7821398625b16aec2e4d782dd2ec26daf2/src/connectivity/mod.rs#L67-L135
The original paper (http://www.cs.kent.edu/~dragan/GraphAn/CycleBasis/p514-paton.pdf) which we implement returns a set of nodes instead a set of edges. #505 pointed out that returning a set of edges is more useful in many cases. The expected enhancement is to have a method for each such that users can get a cycle basis both with nodes and with edges.
The text was updated successfully, but these errors were encountered: