Knowledge Graph 24.3

# Method

The method to use to determine the distance between nodes. When more than one path is available between two nodes, Knowledge Graph uses this method to determine the shortest path. You can use the following options:

- Weighted. Knowledge Graph uses the weights assigned to each edge to determine the length of the edge (a higher weight gives a longer path). It assigns weights at index time, according to your edge configuration.
- InverseWeighted. Knowledge Graph uses the inverse of the weights assigned to each edge to determine the length of the edge (a higher weight gives a shorter path). It assigns weights at index time, according to your edge configuration.
- Uniform. Knowledge Graph assigns a length of one to every edge (that is, the length of the path is the same as the number of connections between nodes in the path).
- Count. Knowledge Graph uses the count for an edge as the length of the edge (a higher count gives a longer path). It stores the counts at index time, according to the number of times a particular edge occurs (that is, the number of times a connections occurs between two given nodes).
- InverseCount. Knowledge Graph uses the inverse of the count for an edge as the length of the edge (a higher count gives a shorter path). It stores the counts at index time, according to the number of times a particular edge occurs (that is, the number of times a connections occurs between two given nodes).

Actions: | GetNeighborhood GetShortestPath GetShortestPaths
Type: | String
Default: |
Example: | `Method=Uniform`
See Also: |

Copyright 2024 Open Text
Version 24.3 | Last updated June 2024

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: IDOL Knowledge Graph 24.3

Topic Title: Method