Time for Wiki Wednesday.

You know - you go to *Wikipedia*, you click on "random article," you report on the outcome.

Here's my random **Wiki Wednesday** find for this week:

In graph theory, the shortest path problem is the problem of finding a path between two vertices such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map; in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment.

This Wiki entry has no business being on a blog called "the Long Cut."

My brain hurts.

Posted by: TwoBusy | 2007.08.02 at 09:50 AM

"This Wiki entry has no business being on a blog called 'the Long Cut.'"

Hee.

Posted by: Sherri W. | 2007.08.02 at 09:55 AM

2B - I make maps for a living (computer-generated maps, no less) and I still don't get it. I just assumed the little Mapquest gnomes inside my CPU did all these calculations.

SW - Ha.

Posted by: Mark | 2007.08.02 at 01:13 PM