Neo4j

Hello everyone!!I'm looking for a way to resolve this problem. I need run graph algorithms on a graph that is in json format, like this (not the real, but similar):{   nodes: [     {       __id: "some_id",       type: "NodeType",      inE: ["node_id1...

I need obtain the n most relevents nodes by degree, and its m most relevants neighbors. I found this solution (maybe isn't the optimal, but is working): here, n and m are desired nodes count And asumme that exist in graph catalog a graph called test,...