Warning: Some posts on this platform may contain adult material intended for mature audiences only. Viewer discretion is advised. By clicking ‘Continue’, you confirm that you are 18 years or older and consent to viewing explicit content.
No need for Matt Parker, just anyone who can program and has a textbook covering graph algorithms. Actually the graph is probably small enough it would be easier to do it by hand than to code a solution.
Seeing this, I now wonder what’s the longest possible chain of “State1-named city, State2; State2-named city…” you can create.
Someone should ping Matt Parker or someone who knows how to code such a lookup program :)
That sounds right up his alley actually.
Might have to avoid the Texas / New York loop though.
No need for Matt Parker, just anyone who can program and has a textbook covering graph algorithms. Actually the graph is probably small enough it would be easier to do it by hand than to code a solution.