ebi-pdbe-graph_node_relationships
Verifies PDBe graph node labels and returns their incoming, outgoing, and self-loop relationships so you can confirm schema directions before writing Cypher queries.
Instructions
Verifies one or more PDBe graph node labels and returns the relationships connected to each label.
Use this tool after inspecting the node and edge schema, when you have selected node labels for a Cypher query
and want to confirm that the labels and relationship directions exist in the PDBe graph schema.
For each requested node label, this tool returns:
- Whether the node label exists in the schema
- Outgoing relationship patterns from that node label
- Incoming relationship patterns to that node label
- Self-loop relationship patterns where both ends use the same node label
- A bidirectional note when the schema has the same relationship label in both directions between two node labels
Parameters:
node_labels (required): A list of exact, case-sensitive node labels to verify.
Example: ["Entry", "Entity", "UniProt"]
Expected Output Format (text):
Node: Entry
Status: Found
Outgoing edges:
- (Entry)-[:HAS_ENTITY]->(Entity)
Incoming edges:
- None
Self-loop edges:
- None
Node: FakeNode
Status: Not found in schema
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| node_labels | Yes | Exact, case-sensitive node labels to verify against the PDBe graph schema. |