Ivan Carvalho
Ivan Carvalho
That makes sense. By the way, once https://github.com/Qiskit/rustworkx/pull/1292 is released in 0.16 I think your code will also run faster if you switch to the iterators
> Yes! Fantastic, I initially started with a generator expression and was disappointed to see it wasn't supported. I assumed it was a quirk related to rust, but glad to...
I'll stop you right at: ``` my_graph_nx = nx.DiGraph() my_graph_rx = rx.PyGraph() ``` For Networkx, you are creating a directed graph. For rustworkx, you are creating an undirected graph. So...
So, I found the issue in the code with the reported bug. There is a big assumption `yield path[0]` that the path list only contains one element. I added an...
I don’t think we have generators for regular graphs, but that could be added
I also ran the additional snippet: ``` for path in paths_rx: if path not in paths_nx: print(f"Not in networkx: {path}") for ind, path in enumerate(paths_nx): path = list(path) if path...
Good, I assigned the issue to you
> Just to make sure I'm not missing something obvious, the comments in [#1088](https://github.com/Qiskit/rustworkx/issues/1088) still apply right? I still call `rx.all_pairs_all_simple_paths()` which will return all the paths on a graph...
See #1033 and #1066 for some related issues. Ideally, we could use Polars very fast CSV parsing, cast it to Arrow data and read that. Also, for reference we benchmarked...
> > Also, for reference we benchmarked a while ago that the time to load a graph with all of the USA roads (~23.9M nodes, ~58.3 M edges) took around...