I am wondering if the graph algorithms that are available for the cypher queries can be made "online".
For example, in the algorithm unionFind, when new nodes are added, the weakly connected components for the new nodes can be found by looking at the weakly connected components of the neighbors of the new nodes. If the cypher user is careful, they would collect all the weakly connected component of the neighbors of the new node and assign the same component if for all the neighboring connected component and for the newly added node. For other graph algorithms, it is possible to make the algorithms run online.
In summary, can we have online implementations of the graph algorithms readily available to run on the graph databases? https://en.wikipedia.org/wiki/Online_algorithm, https://www.amazon.com/Online-Algorithms-Lecture-Computer-Science/dp/3540649174. I guess such implementations would need storing and maintaining some additional data containers in the database - but I think it will be a greatly helpful for the users who focus on their usecases that deal with real data that can get updated on the graph every now and then.
Looking forward for your feedback and comments on this topic.