RouteMaxCost

Top  Previous  Next

Function RouteMaxCost(iterations: integer; var node1, node2: integer): single;

 

This function will return the maximum cost of any cheapest node-2-node route in the network. Node1 and node2 will return the nodes for the associated route.

 

The function uses an approach of a random start points to locate the maximum cost, so a number of iterations needs to be specified. 10 is usually enough, but in rare situations you may need more.

 

Using dynamic segmentation it may be possible to locate higher costs than for node-2-node routes.

 

Possible error codes: -10 -30 -43

Versions: Standard Pro

ActiveX / VCL / CLX component: RWcalc