4 Pathfinding traversals and mutating graphs

This chapter covers

  • Writing traversals to add, modify, and delete vertices, edges, and properties
  • Finding the paths that connect two vertices
  • Refining pathfinding traversals using edges and edge properties

Getting lost has itself become a “lost art” since the advent of GPS devices and smartphones. Long gone are the days of stopping at a local service station to ask for directions. But while we may fear that our direction-finding skills are atrophying in the real world, in the data domain, graph’s pathfinding algorithms come to the rescue--or maybe these precipitated the digitization of this real-world skill.

We emphasized in the last chapter how critical it is to know your location in the graph ...

Get Graph Databases in Action now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.