On the Subject of Shipment Math

No way Rand made a module about ships not being about relationships!

Theory:

There’s a graph G(X,C), where all elements of C are defined as i→j:a@c (i < j),

• i - index of starting node,
• j - index of ending node,
• a - maximum amount of items that may be transferred through this path,
• c - cost of transferring one item through this path.

Module may tell you the Σφi value - this is the goal amount of items to transfer. In case of absence of this value, you will have to find it yourself. Submit the minimal amount of money that must be spent on shipment.

Σφi is always equals to φmax * (0.5 + LSN / 36), where LSN is the last serial number digit.

Navigating:

Pressing M will change modes: Read to Submit and vice versa.

In Read mode, you can type in the index of starting node to see all of its paths. If there are too many paths for a node, you may press Up and Down to go through pages. If you press 0, you will go to the initial screen.

In Submit mode, you may type in your answer. Submit it by pressing M again. If you try to submit 0, module will go into Read mode.