Hi John,

This code might be of some use to you.



On 14 Dec 2012, at 09:32, John May wrote:

Heh, got there just before I tested that myself :-).

Incidentally Nina, there is another fingerprint issue you may be able to help with.

Do you know if there is a quick way to get equal length shortest paths? Using PathTools.getShortestPath Djikstra algorithm if there > 1 shortest paths the choice is based on storage order. One option would be to weight the Djikstra algorithm with some invariants but then we would need to make sure the invariants were truly different. I figure it could be done relatively quickly with a BFS but don't want to rewrite something if there is already a method to do so. There is something in JGraphT but it may be overkill to convert between domain models.


10 -> 4
CCCC or CCOC path used to encode fingerprint bits.

LogMeIn Rescue: Anywhere, Anytime Remote support for IT. Free Trial
Remotely access PCs and mobile devices and provide instant support
Improve your efficiency, and focus on delivering more value-add services
Discover what IT Professionals Know. Rescue delivers
Cdk-devel mailing list