PA6 DistInfo

[Chris Muller]

Hello, All.

I'd like to request clarification on PA6: the various lectures and class notes all reference the use of DistInfo, but the assignment seems to explicitly forbid it ("This API is designed to be client-friendly. Note it has no DistInfo objects which might be unwelcome to the programmers of the client."), which by extension would seem to forbid the use of similar student-made convenience structures.

I have not yet figured out how to implement the dijkstra function without using a similar structure unless I resort to a manual sort process which is order N each time (as opposed to the more desirable order 1 obtainable with the DistInfo/PriorityQueue scheme).  Am I missing something big here, or does the optimal solution just involve a manual sort for the lowest distance vertex at each node?

Thanks,

Chris

[Betty O'Neil]

The *client* is the code calling the API, while most of your
work involves writing the code called by the API, which is
expected to use DistInfo objects to do its work.