This thesis deals with efficient search of such chaining of trades on exchanges (stock markets), that are financially beneficial for the trader. I introduced efficient data structure (graph) for storage of data in form of relations between trading items and variety methods for search of beneficial trade paths on it. I started with uninformed exhaustive search, investigated possible informed searching methods and found a way to reduce search space so much that exhaustive evaluation of valid paths is possible. I achieved this with help of an algorithm for enumerating all elementary circuits in a graph.
|
