This is great. How do you determine a subgraph? What do you mean by too much time? Can it be implemented in C++ or Python?

This is what we use right now: https://memgraph.com/docs/advanced-algorithms/available-algorithms/pagerank_online