Database Reference
In-Depth Information
GraphAlgoFactory.aStar(…) : This returns the algorithm that finds the
cheapest path between two given nodes
GraphAlgoFactory.pathsWithLength(…) : This returns the algorithm
that finds all simple paths of a certain length between two given nodes
In this section, you learned about the various Java APIs and methods exposed by Neo4j
for performing traversing/searching over Neo4j graphs.
Search WWH ::




Custom Search