User contributions
- 19:57, 21 December 2015 (diff | hist) . . (+414) . . N TADM2E 6.23 (Created page with "The problem reduces to Floyd - Warshall algorithm if you take logs of all currency-exchange rates, as if a * b = c then ln(a) + ln(b) = ln(c). In computational finance people...")
- 19:38, 21 December 2015 (diff | hist) . . (+537) . . N TADM2E 6.21 (Created page with "Step 1: Perform topological sorting of the graph (we can do it as Graph is acyclic). This is O(n + m) Step 2: Go through vertices in topological order. Initially all vertic...")
- 19:24, 21 December 2015 (diff | hist) . . (+181) . . N TADM2E 6.19 (Created page with "Simple application of Floyd-Warshall algorithm for directed graphs O(n^3). After running the algorithm we need to search main diagonal for minimum amount, which is additional...")
- 19:00, 21 December 2015 (diff | hist) . . (+503) . . TADM2E 6.15
- 18:49, 21 December 2015 (diff | hist) . . (+62) . . TADM2E 6.13
- 18:49, 21 December 2015 (diff | hist) . . (+10) . . TADM2E 6.13
- 18:48, 21 December 2015 (diff | hist) . . (+498) . . N TADM2E 6.13 (Created page with "Not 100% certain: This problem can be reduced to finding connected components in graph like this: 1. Union phase - on every call we add one more edge to our graph, which is...")
- 20:40, 18 December 2015 (diff | hist) . . (+124) . . TADM2E 6.7
