Hi! I have read the paper describing the algorithm used by the minorminer. It suggests that the minorminer will randomize the vertex in the guest graph in the first step before searching for the vertex model for each vertex in the guest graph. I have some prior knowledge about the guest graph I am going to embed into the hardware. Can I specify the order to explore and not to randomize it?
If yes, could you tell me where in the source code this randomization is done? I am interested in contributing to this project and can add this feature myself.
Hi! I have read the paper describing the algorithm used by the minorminer. It suggests that the minorminer will randomize the vertex in the guest graph in the first step before searching for the vertex model for each vertex in the guest graph. I have some prior knowledge about the guest graph I am going to embed into the hardware. Can I specify the order to explore and not to randomize it?
If yes, could you tell me where in the source code this randomization is done? I am interested in contributing to this project and can add this feature myself.