Implement a way to cache strong and weak links before the first step that uses chaining searcher to search for them, and there's only one cache operation unit.
All the steps after the step having been applied, caching operation won't be redone. As a substitution, by removing strong and weak links stored from the cache, we can prevent a whole caching operation to optimize the searching.
Implement a way to cache strong and weak links before the first step that uses chaining searcher to search for them, and there's only one cache operation unit.
All the steps after the step having been applied, caching operation won't be redone. As a substitution, by removing strong and weak links stored from the cache, we can prevent a whole caching operation to optimize the searching.