TCalc |
Top Previous Next |
|
This class is used for one-to-many route calculations, the Dijkstra algorithm is used. Use TRouteCalc for one-to-one route calculations.
Typical sequence when using TCalc is like this:
Call SetTime and/or SetCost if you want to calculate more than just length of routes.
Define which criteria you want and call the corresponding method: SetShortest, SetFastest or SetCheapest.
The SkipLinkList can be used to ignore certain links in the route calculations.
Eventually set MaxCost, if you want to create a smaller isochrone than otherwise.
MaxSpeed can be used to override the speed for the network, in case of slow vehicles.
NoDriveThrough can be set to avoid areas, where you are not allowed to drive through ("no access").
Finally call one of the actual isochrone methods, possibly followed by additional query methods:
If you just want cost: •IsoCost or IsoCostList or IsoCostListN > NodeCost or LinkCost •IsoCostDyn or IsoCostListDyn or IsoCostListNDyn > NodeCost or LinkCostDyn •IsoCostDynApproach > LinkCostDynApproach
If you want cost and the route: •IsoCost or IsoCostList > RouteFind > RouteCost, RouteLength and / or RouteTime •IsoCostDyn or IsoCostListDyn or IsoCostListNDyn > RouteFindDyn > RouteCost, RouteLength and / or RouteTime •IsoCostDynApproach > RouteFindDynApproach > RouteCost, RouteLength and / or RouteTime
Matrix methods: (to TMatrix)
Matrix methods: (output to GIS files)
Other methods:
Methods for isochrones (see also here): 2.IsoPoly 3.AlphaShape (Pro only)
It is worth noting that Cost in TNetwork is different from Cost in TCalc:
•In TNetwork it is a generalized cost for a single link (or turn delay), much similar to the length or time of a link.
•In TCalc it is the result of a route / isochrone calculation from a starting point to somewhere else. The cost can be either distance (SetShortest), time (SetFastest) or "cost" (SetCheapest), depending upon which criteria has been set up.
|