In order to test your understanding, try to answer the following questions. The answers are provided in the Assessment part at the end of this book:
- The GDS plugin and projected graphs:
- Why does the GDS plugin use projected graphs?
- Where are these projected graphs stored?
- What are the differences between named and anonymous projected graphs?
- Create a projected graph containing:
- Nodes: label Node
- Relationships: types REL1 and REL2
- Create a projected graph with:
- Nodes: labels Node1 and Node2
- Relationships: type REL1 and properties prop1 and prop2
- How do you consume the results of a graph algorithm from the GDS plugin?
- Pathfinding:
- Which algorithms are based on Dijkstra's algorithm?
- What is the important restriction regarding an edge's weight for these algorithms?
- What information is needed to use the A* algorithm?
