Knowledge Graph Builder | mysimulator.uk

Add a triple

Subject

Predicate

Object

Click any two entity nodes in the graph to find the shortest relational path between them.

Stats

Entities

–

Triples

–

Triple store

How it works

A knowledge graph stores facts as triples: (subject, predicate, object) — e.g. "Einstein — born_in — Ulm". Each unique entity becomes a node; each triple becomes a directed, labeled edge. Adding a triple that mentions a new entity inserts a node and lets a force-directed layout settle it into place.

repel(nᵢ,nⱼ) = k / d²
attract(edge) = -k · (d - restLen)
pos += Σforces · dt

Selecting two nodes runs a breadth-first search (BFS) over the edges, treating the graph as undirected for traversal, to find the shortest chain of relations connecting them — the same mechanism real knowledge graphs (e.g. RDF triple stores queried with SPARQL) use to answer "how is X related to Y?" by walking the graph instead of storing every relationship explicitly.

Add a triple — pick subject, predicate and object from the dropdowns and click Add; the graph grows and re-layouts live.
Click two nodes — highlights every triple touching each, then traces and labels the shortest path between them (or reports "no path" if they're in disconnected components).
Reset — restores the starter graph.

Person Place Organization Work Selected Path

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.