I am trying to prove the following:
For any positive natural n, there exists an undirected graph of n nodes, positive natural edge widths, and nodes s and t such that a uniform-cost search from s examines all the nodes, whereas the optimal path from s to t consists of only a single edge.
