You make it sound like a long walk.

A shortrange transmission.

Very dangerous over short distances.

I'm wasted on crosscountry. We Dwarves are natural sprinters.

We could have said something like this distance, but this distance wouldn't be the shortest distance between this point and this line.

No. It's a shortrange fighter.

It's a marathon, not a sprint.

So let's just leave that unlabeled right now.

We can lock it down, and that finishes the picture.

So the running time of Dijkstra in terms of n and M and here's a sketch of the algorithm again.

And why it's important is that for this vertex if you sum up the distances to the 2 hubs, which you have, you will get the shortest path distance.

Ten miles is not a short distance.

There will probably be this point right here because the distance from there to there is this name as the distance from if you just drop a line straight down.

SS Yes, there you go.

So she's going to make some distance up so he's not going to have to travel quite as far.

The answer I want to see is 7 and not 6.

So, following sort of a naive kind of algorithm design, well, this should work and it's not so terrible.

But let's take a look at the running time given that we can do this distance reduction operation in logarithmic time.

So this distance up here is 45vb.

These are supposed to simulate the actual form of a sprinter when they run.

Let's think about it for a little bit, you'll see there is really only two possibilities.

So a circle is a special case of this, because in a circle's case, the furthest we get from the origin is the same distance as the closest we get, or, in other words, we are always the exact same distance away from the origin.

So how many meters?

What is the distance?

Point blank range.

So it would be that distance plus that distance plus that distance plus that distance.

And the other thing to think about, and we already did that in the previous drawing of the ellipse is, what is this distance?

So it would be the distance around.

That's this distance right there.

Probably the distance.

Shots at close range.

So really, if we're honest, Peach is kinda accidentally playable in this one.

What do we do as long as there's more nodes that we need to analyze,

So if this distance is the same as this distance, then the magenta distance minus this blue distance is going to be equal to this green distance.

Here's the sketch of the algorithm again.

How far is it from here to the city?

Using this pointer, made out of reflective markers,

They still have to climb down to the middle terrace.

Distance

Distance exponent

At a distance of

Distance

How far down is the armory?

We use a lot of laser range finders.

So that's 15 fewer km.. And so the number of km that Beth ran would be this distance right over here.