Nice one, reading that post makes me wonder if the proof could be furthered when considering parallels from compression algorithms.
Compression algorithms detect recurring blocks and remove them with a special symbol and I think the shortest path would be uncompressable with compression algorithms.
Compression algorithms detect recurring blocks and remove them with a special symbol and I think the shortest path would be uncompressable with compression algorithms.