Flying Squid to [email protected] • 1 year agoFrench woman hit by apparent meteorite while relaxing on her terracegizmodo.comexternal-linkmessage-square25arrow-up1158arrow-down12cross-posted to: [email protected]
arrow-up1156arrow-down1external-linkFrench woman hit by apparent meteorite while relaxing on her terracegizmodo.comFlying Squid to [email protected] • 1 year agomessage-square25cross-posted to: [email protected]
minus-squarefearoutlinkfedilink5•1 year ago Alaska, New Mexico New Mexico, Maryland 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 :)
minus-square@[email protected]linkfedilink3•edit-21 year agoThat sounds right up his alley actually. Might have to avoid the Texas / New York loop though.
minus-square@[email protected]linkfedilink2•edit-21 year agoNo 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.