Search:

I got it now, thanks so much for taking time to help me out.

Thanks!

OK, so would this tell me the actual path, or just how many blocks that path is? I understand that we are building a matrix with minimum distance, Im just not completely clear on how we're doing it.

I have a weighted, undirected graph. I have a Minimum Spanning Tree for that graph. One edge (u,v), with weight w, is added to the graph.

How can I update the minimum spanning tree in O(V) time?
...

Thanks, Sfel, but I really have never coded a breadth first search before. Could be a little more clear on exactly how i'd go about keeping track of the minimum path, or WHY it always gets the...

Could I use breadth-first search, implemented with an adjacency list, which is O(E+V)?

I'm not arguing that you dont look ahead, obviously blindly choosing a path wouldn't result in an optimal solution, or O(n) time. I think we need to look at the problem, and the dangerous...

adak - Wouldn't evaluating each move to 2 levels bring the algorithm to O(n^2)?

I think there's some insight into this problem that none of us are getting.

Thanks for your help. There is definitely a solution, as I've found almost the exact same problem in textbooks (dating back to 1998) when googling for an answer.

That's why I think it's not just...

Im not extremely familiar with shortest-path algorithms, which can I use to solve this in O(XY)?

Hey, long time reader, first time poster.

I'm working on a dynamic algorithm, and I've hit a roadblock in my thought process. Here's what I'm trying to do:

I'm given a X x Y rectangular grid in...