Kelly Boothby
Kelly Boothby
I recall thinking about this while writing the `argmap` meta-decorator, and it was regarded as complexity we didn't need. I've been away from networkx for a few months, but if...
There's a really cool graph hashing algorithm in networkx that might save significant effort here: https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.html#networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash
I like this suggestion, Andrew. I'm unsure of what to do for authorship. The original citation for the heuristic embedding algorithm is due to Cai, McReady and Roy (where the...
Would you please provide a graph that exhibits that behavior?
I have managed to extract minimal working examples from proprietary data before. Does the algorithm exhibit the same behavior on the induced graph of the single cycle you're seeing repeated?...
I agree, @randomir. The disk cache I wrote here is entirely out of place, I hate just about every line of it, and I do not want to continue maintaining...
@dwave-bnugmanov that failed test is not a result of this patch, it's known to be a little noisy
Perhaps this will only confuse matters -- this is related to @hhtong's latest comment on dwavesystems/dwave-system#321 -- I've hacked up a view whose vartype can change without making copies ```python...
One feature of the above is that you can change the vartype inplace without making a copy, and then if you want to make a copy, you can simply call...
Ooh I quite like that