Skip to main content

Overview

This endpoint allows you to traverse relationship networks starting from one or more concepts, following chains of relationships to discover connected concepts. Uses a recursive graph traversal algorithm with cycle detection.

Request Body

array
required
Array of starting concept IDs for traversal (1-50 concepts)
object
Optional parameters for controlling the traversal

Query Parameters

string
Specific vocabulary release version (e.g., “2025.1”)

Response

boolean
required
Indicates whether the request was successful
object
required
Response data containing traversal results
object
required
Response metadata

Usage Examples

Basic Traversal

Simple traversal with default settings:

With Path Details

Include detailed path information:

Multiple Starting Concepts

Traverse from multiple concepts:

Vocabulary-Filtered Traversal

Limit to specific vocabularies:

Important Notes

  • Concept limit: Maximum 50 starting concepts per request
  • Depth limit: Maximum traversal depth is 5 to prevent performance issues
  • Cycle detection: The algorithm prevents infinite loops by tracking visited concepts
  • Performance: Deep traversals with many starting concepts may take longer
  • Default relationships: If not specified, uses [“Is a”, “Subsumes”, “Mapped from”]