You must cross each bridge exactly one time. I suspect that there is no solution, but I am unable to formally prove it (i.e. running a graph search and telling that there are no solutions is not an ideal proof, I would like to prove it a priori). Any ideas?5yr ⋅ Menesio ⋅ r/AskComputerScience
