Visual Site Architecture Mapper
Inspect a supplied internal-link graph without crawling: find orphans, inbound hubs, and shortest depth from a chosen home page.
Enter one /from -> /to pair per line, up to 500 pairs and 100,000 characters; each path is at most 500 characters with no whitespace. No URLs are fetched. Orphans have no inbound supplied link except the chosen home path; hubs are ranked by inbound count; depth is the shortest supplied path from home.
A QUICK WALKTHROUGH
How to use this tool
- Internal links: /from -> /to
- Create result
- Mapped 4 unique pages.
Limits and privacy
Enter one /from -> /to pair per line, up to 500 pairs and 100,000 characters. No URLs are fetched. Orphans have no supplied inbound link except home; hubs are ranked by inbound count; depth is the shortest supplied path from home. The separate tree still uses a first parent, and all edges remain listed.
GOOD TO KNOW
Common questions
Is data uploaded?
No. Your input is processed locally in this browser.