> ## Documentation Index
> Fetch the complete documentation index at: https://docs.graphify.com/llms.txt
> Use this file to discover all available pages before exploring further.
# Edges and provenance
> Read what a relationship claims, where it came from, and how certain it is.
A graph edge connects a source node to a target node. Its `relation` explains the connection, such as `calls`, `imports`, `inherits`, or `references`.
## Confidence labels
| Label | What it means | How to use it |
| ----------- | -------------------------------------------------------------------------- | ------------------------------------------------------------------------ |
| `EXTRACTED` | The relationship is explicit in the analyzed source. | Follow the source reference to inspect the evidence. |
| `INFERRED` | Graphify derived the relationship through resolution or semantic analysis. | Read the evidence and any confidence score before treating it as a fact. |
| `AMBIGUOUS` | The evidence does not establish one clear relationship. | Keep the uncertainty visible and check the source. |
An inferred edge can be derived **without a model**. Static name and import resolution can infer cross-file relationships, while a semantic backend can infer connections between documents and code.
## Direction matters
`A calls B` differs from `B calls A`. The current path command and MCP `shortest_path` tool respect stored direction by default. Use `--undirected` in the CLI or `undirected: true` in MCP to explore connectivity regardless of direction.
```bash theme={null}
graphify path "ApiHandler" "DatabaseClient"
graphify path "ApiHandler" "DatabaseClient" --undirected
```
These are example names. Replace them with nodes from your project.
## A path is evidence, not a runtime guarantee
Source-level calls may be conditional or dynamically resolved. A path shows the relationships in the analyzed graph; it does not prove a request will execute that path or that a change is safe.
Use [formal verification](/platform/verification) for the distinct enterprise workflow that compares supported changed functions. Graph traversal itself is not a formal proof.