Friday, October 7, 2022

Bonus-Bonus Rust problem: spanning multiplicative currency graph

BONUS-BONUS RUST QUESTION TO THIS PROBLEM!

Both Dijkstra's algorithm and the Minimum Spanning Tree use ADDITIVE paths to find the best currency swaps, but my graph is MULTIPLICATIVE.

Write a Rust program that spans the multiplicative currency graph to find the best swap A -> B.

To be explicit: this problem is asking you to invent new math, as the graph-pathing literature does not consider this scenario in the main.

No comments:

Post a Comment