Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 416 Bytes

README.md

File metadata and controls

5 lines (3 loc) · 416 Bytes

candidate-selection

Utilities for picking candidates out of a set based on the weighted product model over criteria such as success rate, latency, etc.

This library is heavily influenced by, and intended to replace, the original indexer selection algorithm used by the Graph Gateway. The original algorithm was designed by Zachary Burns & Theodore Butler.