GDS library content

The GDS plugin contains several types of algorithms. In this chapter, we will focus on the shortest path algorithms, but in later chapters, we'll also learn how to do the following:

• Measure node importance: The algorithms we use for this are called centrality algorithms. They include, for example, the PageRank algorithms developed by Google to rank search results (see Chapter 5, Node Importance).
• Identify communities of nodes (see Chapter 7, Community Detection and Similarity Measures).
• Extract features to perform link prediction (see Chapter 9, Predicting Relationships).
• Run graph embedding algorithms to learn features from the graph structure (see Chapter 10, Graph Embeddings—from Graphs to Matrices).

The names of procedures have a common syntax:

gds.<tier>.<algo>.<write|stream>(graphName, configuration)

Let's look at each of the components in detail:

• tier is optional. If the procedure name doesn't contain tier, it...