Hi,
I am struggling a bit to figure out how to create a named graph for GDS analysis.
My objective: I have a central point of interest (central blue node), a patent in this case. There are other patents which have a relationship, cited by an examiner in this case. Now patents have technology classifications, cpc codes, and the cpc codes are part of a tree structure hierarchy.
What I am interested in answering: For the cpc nodes attached to my target patent what is the shortest route from those cpc codes to the cpc codes of the cited patents. It seems like I would like to do a version of shortest path but only traversing the :Classified_as and :Reports_to relationships.
Question 1. How would I write the gds.graph.create to capture this graph. The examples in the documentation are relatively simplistic.
Question 2. How would I wind array of nodes to get all shortest paths?
Question 3. In cypher I am getting a warning that the where clause I am using is depreciated, what would the alternative suggested form be?
Match p=(x:patent{num:7122415})-[:Classified_as]->(a:cpc)-[:Reports_to*]-(:cpc)<-[:Classified_as]-(b:patent)
where (x)-[:Cites{who:'examiner'}]->(b)
return p
Thanks in advance
Andy