I am working with a large graph of Wikipedia topics having more than 16 million nodes and 400 million edges. Trying to find important topics from the set of some topics. For that, I want to use PageRank on a subgraph of the Wikipedia graph. Using PageRank by using match cypher query is taking a lot of time > 5 mins. How can it be optimized? see the first comment below
Is there a way by which I can get subgraph of the whole graph. like If I have titles of the topic, I want to get all nodes and relationship among matched nodes.