Also known as Chinese postman problem, Guan's route problem, postman tour
in graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).