TLDR
In a graph graph, we use computer science and computer science to find the shortest-path to finding arbitrage opportunities. The graph is an incredibly important structure that uses its structure in numerous applications. We need an efficient algorithm, lest someone else beat us to an efficient arbitrageur. The arbitrage opportunity is exploited until the market reaches an equilibrium. We’ve worked with 3 simple examples, but what if you needed to find a market for each pair, how quickly you find an opportunity? And what if it needed to be used in a network of 20 currencies?via the TL;DR App
no story
Written by skzv | Software engineer at Google, engineering physicist by training. Builder by passion.
skzv.dev
