SAP

Manage my Account SAP Devs YouTube ↗ Learnings ↗ Community ↗ Provide Feedback ↗
Logout
⤢ Open full site

Graph Traversal and Shortest Path Algorithms

A Graph Procedure in SAP HANA Cloud is a database procedure that runs graph algorithms—such as shortest path, isochrone, and closeness centrality calculations—directly against a Graph Workspace. Developers use it to perform network and spatial analyses, for example calculating the shortest path between two vertices or applying a cost function to weight traversal edges in a connected dataset.

Tutorials that teach this

Prerequisites

Concepts that build on this