Oops, you are correct. I didn't look closely enough at the API. Ah well. On Thu, 20 Mar 2008 13:09:28 -0400, Evan Stratford wrote: Scott Rycroft wrote: 'fudge it' is such an ugly word for it. I prefer 'necessary workaround'. :) Angus Sinclair wrote: you can if you handle those "updates" carefully I think. you kind of have to fudge it. Yes, but the ...

Scott Rycroft wrote: 'fudge it' is such an ugly word for it. I prefer 'necessary workaround'. :) Angus Sinclair wrote: you can if you handle those "updates" carefully I think. you kind of have to fudge it. Yes, but the obvious workaround using Java's PriorityQueue destroys your runtime. -- evan

It is included in the mark on the hardcopy of your assignment. I will also send the marks by email to all students, including the breakdown of marks, by tonight. On Tue, 18 Mar 2008, Scott Rycroft wrote: Where do we find our marks for the coding section?

...: We are looking for "heap" implementation of dijkstra. On Mon, 17 Mar 2008, Scott Rycroft wrote: When the assignment says "should not take more time than running Dijkstra’s algorithm", what version ... better or worse) version? On Mon, 17 Mar 2008 00:30:58 +0000, Scott Rycroft wrote: Also to clarify, is going from (x,y) to (x+1,y+1) considered one unit?...

... than running Dijkstra’s algorithm", what version of Dijkstra's should we be comparing to? The one we will be using or some other (possibly better or worse) version? On Mon, 17 Mar 2008 00:30:58 +0000, Scott Rycroft wrote: Also to clarify, is going from (x,y) to (x+1,y+1) considered one unit? On Thu, 13 Mar 2008 21:22:18 -0400, Mina Razaghpour wrote: It means going ...

No, this is sqrt(2) units (euclidean distance between the 2 points). On Mon, 17 Mar 2008, Scott Rycroft wrote: Also to clarify, is going from (x,y) to (x+1,y+1) considered one unit? On Thu, 13 Mar 2008 21:22:18 -0400, Mina Razaghpour wrote: It means going directly from (x,y) to (x+1,y+1), or generally, walking along the direct line between any two points (as long as ...

...int** array = new int*[n]; for (int i=0; i<n; i++) array[i]=new int [n]; But yeah, STL is about as easy as Java. On Sun, 24 Feb 2008 14:28:07 -0500, Gordon V. Cormack wrote: Scott Rycroft wrote: void func(int** array, int n) That's an array of pointers, not a 2-d array. or use Java :) Let's not get carried away. STL will do it, or you can create your own ...

Scott Rycroft wrote: void func(int** array, int n) That's an array of pointers, not a 2-d array. or use Java :) Let's not get carried away. STL will do it, or you can create your own mapping function. #define myarray(a,b,c) = x[((a)*d1+(b))*d2+(c)]

The input file will be formatted correctly. You don't need to check. On Fri, 22 Feb 2008, Scott Rycroft wrote: Can we also assume that the input file will be formatted correctly (valid), or do we have to check? On Thu, 21 Feb 2008 23:31:37 -0500, Angus Sinclair wrote: Considering that this is due so soon after reading week and the fact that there are multiple cs ...

And another thing, what do we do for deciding between multiple optimal solutions? On Fri, 22 Feb 2008 16:08:08 +0000, Scott Rycroft wrote: Can we also assume that the input file will be formatted correctly (valid), or do we have to check? On Thu, 21 Feb 2008 23:31:37 -0500, Angus Sinclair wrote: Considering that this is due so soon after reading week and the fact ...