http://mat.i2p/internet-roadtrip-pathfinder
My first attempt used a least- recently- used cache as I was comfortable with them, but it later became apparent that an LRU cache wasn’t a good solution since calculating a path that involved considering more than 4 million nodes would just obliterate the cache. I knew of a few alternative caching strategies, so I considered my options. I didn’t really want to implement a cache myself, and looking at the libraries it seemed like the main options were Moka , Mini Moka , and Quick Cache .