RecallGraph Docs
Search…
Introduction
Understanding RecallGraph
Background
Terminology
Working With RecallGraph
Installation
Changelog
Guide
Persisting Documents
Analyzing the Event Log
Navigating History
Show
Traverse
k Shortest Paths
Advanced Guide
External Links
Project Home
HTTP API
Provider API
Community Forum
Releases
Project Tracker
Powered By GitBook
Navigating History
Get historical states of individual vertices/edges, and run traversals and shortest path queries on past versions of a graph.
In this section, we will see how to look back at historical states of nodes and edges, and run traversals and shortest-path queries on them. As with the previous exercises, we will use the HRMS example as the backdrop in which we keep building the narrative.
RecallGraph's History API supports 3 endpoints:
  1. 1.
    A SHOW endpoint to rebuild previous states of nodes at specified points in time within a specified scope, with support for grouping, sorting, slicing and post-filtering.
  2. 2.
    A TRAVERSE endpoint to run AQL-like traversals over historic data, with the option to post-filter on vertex and edge sets.
  3. 3.
    A k SHORTEST PATHS endpoint to run weighted shortest path queries over historic versions of the graph.
We will explore these endpoints in the sections linked below:
Previous
Diff
Next
Show
Last modified 2yr ago
Copy link