Knowledge Graph 25.3
Knowledge Graph Reference

# GetShortestPath

Finds the shortest path in the graph between two specified nodes.

## Example

    http://12.3.4.56:10300/action=GetShortestPath&SourceName=alice%40example.com&TargetName=bob%40example.com

This action finds the shortest path through your graph between `alice@example.com` and `bob@example.com`.

## Parameters

Parameter | Description | Required
--- | --- | ---
Method | The method to use to determine the distance between nodes. | Yes
SourceID | The ID of the source node for the path. | See Comments
SourceName | The name of the source node for the path. | See Comments
TargetID | The ID of the target node for the path. | See Comments
TargetName | The name of the target node for the path. | See Comments

## Comments

You must specify:

- One of SourceName and SourceID.

AND

- One of TargetName and TargetID.

Copyright 2025 Open Text
Version 25.3 | Last updated July 2025

Send documentation feedback

Close

Send documentation feedback

To send feedback using your default email client, open an email window.

Otherwise, send your feedback and the information below to MFI-swpdl.idoldocsfeedback@opentext.com.

We appreciate your feedback!

Product: Knowledge Discovery Knowledge Graph 25.3

Topic Title: GetShortestPath