By shriphani on July 2, 2010
Using the Bellman-Ford Single Source Shortest Path algorithm to detect triangular arbitrage.
Posted in Computer Science, python | Tagged algorithms, arbitrage, bellman-ford, Computer Science, cs, graphs, python, shortest-path, triangular-arbitrage | 8 Responses