Background:
One of the core algorithms we will be using to locate nodes is bidirectional search. We need this implemented in the application to process data from, or in conjunction with, Neo4j.
Success Criteria:
A bidirectional search algorithm has been implemented in the application.
Data from Neo4j (e.g.: a subgraph) is used as input to the algorithm.
Output from the algorithm is in a format which is readily usable by the UI.
Background: One of the core algorithms we will be using to locate nodes is bidirectional search. We need this implemented in the application to process data from, or in conjunction with, Neo4j.
Success Criteria: