IRI Path Finder
Load an ontology/graph file, pick two IRIs (or an IRI and a literal), optionally constrain predicates, and compute the shortest path or enumerate paths. All in-browser.
Graph file (TTL, NT/NQ, JSON-LD, RDF/XML)
Format (optional override)
Auto-detect
Turtle / N3
N-Triples / N-Quads
N-Quads
TriG
JSON-LD
RDF/XML
Base IRI (for resolving relative IRIs)
Start node (IRI or literal)
Goal node (IRI or literal)
Edge direction
Directed (subject → object)
Undirected (allow traversing both directions)
Predicate filter mode
All predicates
Only these predicates
Only owl:ObjectProperty (from data)
Descendants of these root properties
Allowed predicates (one per line)
Subproperty roots (one per line)
Max depth (for search)
Protects against infinite/huge graphs
Max paths (when enumerating all)
Include literal nodes
Yes
No (IRIs only)
Load graph
Find shortest path
Find all paths
Generate SPARQL for shortest path
No graph loaded
Logs
Shortest path (ordered)
All paths (limited)
SPARQL query for the shortest path