So we're trying to efficiently go over all of the connected components in the graph,
and add a node with an "updateTime" property to each component - so we can easily reference recently changed components for exporting purposes.
I checked the graph data science WCC algorithm, but it seems like it requires loading the graph into memory (and a graph with 60 million nodes and counting makes it a bit tricky).
I know there's an APOC library function - like path.subgraphAll etc, but if I want to use it on every node in the graph, it becomes extremely inefficient.
Is there a better way that we're missing?