On Wed, Feb 26, 2003 at 09:23:25AM +0100, Alfredo Braunstein wrote: > * clean a little the implementation, separating the 'graph' part from the > conversion part. > > * add weights (slowness and accurateness) to converters and find the least > weighted path instead of the shortest, as suggested by JMarc. We can then > pass an optional flag (or even a real value between 0 and 1) to the > converter code asking for accurateness or for speed. > > Is it ok?
Definitely. > Advices? I think I have some code flying around that implement shortest path searches. Interested? Andre' -- Those who desire to give up Freedom in order to gain Security, will not have, nor do they deserve, either one. (T. Jefferson)
