intlrunner

What is the shortest path for this problem.

I watched 3 lectures at MIT for the shortest path and I conceptually understand what is going on, but I don't understand this problem:

the number of shortest paths from 101st & 1st to 120th & 10th.

That's all I have, so I have to assume the general form.

Help?

Thanks,

Matt

I watched 3 lectures at MIT for the shortest path and I conceptually understand what is going on, but I don't understand this problem:

the number of shortest paths from 101st & 1st to 120th & 10th.

That's all I have, so I have to assume the general form.

Help?

Thanks,

Matt