tigergraph__has_node
Checks whether a vertex with a specified type and ID exists in the graph, returning a boolean for conditional workflows without fetching full vertex data.
Instructions
Purpose: Check if a vertex (node) exists in the graph without retrieving its full data.
When to Use:
Verify a vertex exists before operations
Validation in data pipelines
Conditional logic based on vertex existence
Lightweight existence checks (faster than get_node)
Key Features:
Returns simple boolean result (exists: true/false)
More efficient than get_node() for existence checks
No data transfer overhead
Common Workflows:
Safe operations:
has_node()→ if true, proceed with get_node()/delete_node()Validation: Check required vertices exist before adding edges
Conditional creation: If not exists, create with add_node()
Tips:
Use this instead of get_node() when you only need existence confirmation
Combine with add_node() for upsert logic
Faster than catching errors from get_node()
Related Tools:
get_node: Retrieve full vertex data if it exists
add_node: Create vertex if it doesn't exist
delete_node: Remove vertex after confirming existence
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| profile | No | Connection profile name. Omit to use the active default profile. Use 'list_connections' to see available profiles. | |
| vertex_id | Yes | The unique identifier of the vertex | |
| graph_name | No | Name of the graph (uses default if not specified) | |
| vertex_type | Yes | The type of the vertex to check |