Ben Steer

Currently have several algorithms planned for implementation - as they get grabbed out of this list we can make a separate ticket for them and ref back here. Vertex-specific algorithms:...

As from #1037 we have some basic filtering of nodes in graphQL - selecting in/out degree less than/greater than a given value and checking the value of names/node type. This...

Edge deletions currently require an addition event in the history of the source and destination node - we need to double check if this is a sensible semantic and if...

Currently the CSV loader crashes if even one line doesn't fit the provided function - obviously handling can be done by the user, but this requires a lot more effort...

As part of the ongoing benchmarking efforts, we would like to implement the LDBC Social Network benchmark model (http://ldbcouncil.org/benchmarks/snb/). Following the the model ingestion we will be able to start...

From @ljeub-pometry: > We want a way to sample random Vertices from a graph that are not connected to the current vertex, e.g., teleportation in random walks

Currently we are able to call functions such as neighbours multiple times on a vertex which will then be unravelled in the core to return nodes n hops away -...

In prior versions of Raphtory we were able to explode vertices as well edges, with the nodes being able to reference/communicate with their past and future selves. This functionality needs...