This chapter was a long one, as it was our introduction to the GDS plugin. It is important to understand how to define the projected graph and the different entities to be included in it. We will see more examples in the following chapters, as we are going to use this library in all remaining chapters of the book.
The following table summarizes the different algorithms we have studied in this chapter, with some important characteristics to keep in mind:
| Algorithm | Description | Stream/Write | Negative weights |
| shortestPath | The shortest path between two nodes using Dijkstra's algorithm | Both | No |
| shortestPath.astar | The shortest path between two nodes using the A* algorithm and great circle heuristics (requires nodes with latitude and longitude properties) | Stream | No |
| kShortestPath | The k-shortest paths between two nodes using Yen's algorithm | Both | Yes |
| shortestPath.deltaStepping | Single source shortest path: the shortest path between a node and all other nodes in the graph... |
