4 ms·
Thanks for the context. Offtopic, does Memgraph have something similar to NetworkX's connected components [1]? Wondering what's the performance difference betw
by rkwz 4y ago
Thanks for the context.
Offtopic, does Memgraph have something similar to NetworkX's connected components [1]? Wondering what's the performance difference between both for different sizes of graphs.
[1] https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.components.connected_components.html https://networkx.org/documentation/stable/reference/algorith...
- katelatte 4y agoWe do have our own implementation of weakly connected components [1]. Currently, we only have NetworkX strongly connected components algorithm [2] as a part of the nxalg module (set of procedures) in MAGE (our graph algorithms library). I did not compare it yet, let me know if you do! We definitely need to create official benchmarks. Lot of work! [1] https://memgraph.com/docs/mage/query-modules/cpp/weakly-connected-components https://memgraph.com/docs/mage/query-modules/cpp/weakly-conn... [2] https://memgraph.com/docs/mage/query-modules/python/nxalg#strongly_connected_components https://memgraph.com/docs/mage/query-modules/python/nxalg#st...
- katelatte 4y agoI forgot to mention: we do have biconnected components algorithm [1], and since all biconnected graphs are strongly connected, it can be useful. [1] https://memgraph.com/docs/mage/query-modules/cpp/biconnected-components https://memgraph.com/docs/mage/query-modules/cpp/biconnected...