| | | 1 | | using System; |
| | | 2 | | using Itinero.Network; |
| | | 3 | | using Itinero.Routes.Paths; |
| | | 4 | | using Itinero.Routing.Costs; |
| | | 5 | | using Itinero.Snapping; |
| | | 6 | | |
| | | 7 | | namespace Itinero.Routing.Flavours.Dijkstra; |
| | | 8 | | |
| | | 9 | | /// <summary> |
| | | 10 | | /// Extensions related to snap points. |
| | | 11 | | /// </summary> |
| | | 12 | | public static class SnapPointExtensions |
| | | 13 | | { |
| | | 14 | | /// <summary> |
| | | 15 | | /// Returns a factor in the range [0, 1] representing the position on the edge. |
| | | 16 | | /// </summary> |
| | | 17 | | /// <param name="snapPoint">The snap point.</param> |
| | | 18 | | /// <returns>The factor.</returns> |
| | | 19 | | public static double OffsetFactor(this SnapPoint snapPoint) |
| | 220375 | 20 | | { |
| | 220375 | 21 | | return snapPoint.Offset / (double)ushort.MaxValue; |
| | 220375 | 22 | | } |
| | | 23 | | |
| | | 24 | | /// <summary> |
| | | 25 | | /// Calculates a single edge path using the given cost function if the two snap points are on the same edge. |
| | | 26 | | /// </summary> |
| | | 27 | | /// <param name="routingNetwork"></param> |
| | | 28 | | /// <param name="origin"></param> |
| | | 29 | | /// <param name="destination"></param> |
| | | 30 | | /// <param name="costFunction"></param> |
| | | 31 | | /// <param name="path"></param> |
| | | 32 | | /// <param name="cost"></param> |
| | | 33 | | /// <returns></returns> |
| | | 34 | | /// <exception cref="Exception"></exception> |
| | | 35 | | public static bool TrySingleHop(this RoutingNetwork routingNetwork, |
| | | 36 | | SnapPoint origin, SnapPoint destination, ICostFunction costFunction, |
| | | 37 | | out Path path, out double cost) |
| | 83 | 38 | | { |
| | 83 | 39 | | path = null; |
| | 83 | 40 | | cost = double.MaxValue; |
| | 113 | 41 | | if (origin.EdgeId != destination.EdgeId) return false; |
| | | 42 | | |
| | 53 | 43 | | var enumerator = new CostEdgeEnumerator(routingNetwork.GetEdgeEnumerator(), costFunction); |
| | 53 | 44 | | if (!enumerator.MoveTo(origin.EdgeId, true)) throw new Exception(); |
| | 53 | 45 | | var tailToHeadCost = enumerator.GetCost(true); |
| | 53 | 46 | | var headToTailCost = enumerator.GetCost(false); |
| | 53 | 47 | | if (headToTailCost.cost <= 0 && tailToHeadCost.cost <= 0) return false; |
| | | 48 | | |
| | 53 | 49 | | if (origin.Offset == destination.Offset) |
| | 40 | 50 | | { |
| | 40 | 51 | | var tailToHead = tailToHeadCost.cost > 0; |
| | 40 | 52 | | path = new Path(routingNetwork); |
| | 40 | 53 | | path.Append(origin.EdgeId, tailToHead); |
| | 40 | 54 | | path.Offset1 = origin.Offset; |
| | 40 | 55 | | path.Offset2 = destination.Offset; |
| | 40 | 56 | | cost = 0; |
| | 40 | 57 | | } |
| | 13 | 58 | | else if (origin.Offset < destination.Offset) |
| | 8 | 59 | | { |
| | 8 | 60 | | var tailToHead = tailToHeadCost.cost > 0; |
| | 9 | 61 | | if (!tailToHead) return false; |
| | | 62 | | |
| | 7 | 63 | | path = new Path(routingNetwork); |
| | 7 | 64 | | path.Append(origin.EdgeId, true); |
| | 7 | 65 | | path.Offset1 = origin.Offset; |
| | 7 | 66 | | path.Offset2 = destination.Offset; |
| | | 67 | | |
| | 7 | 68 | | cost = (destination.OffsetFactor() - origin.OffsetFactor()) * tailToHeadCost.cost; |
| | 7 | 69 | | } |
| | | 70 | | else |
| | 5 | 71 | | { |
| | 5 | 72 | | var headToTail = headToTailCost.cost > 0; |
| | 6 | 73 | | if (!headToTail) return false; |
| | | 74 | | |
| | 4 | 75 | | path = new Path(routingNetwork); |
| | 4 | 76 | | path.Append(origin.EdgeId, false); |
| | 4 | 77 | | path.Offset1 = (ushort)(ushort.MaxValue - origin.Offset); |
| | 4 | 78 | | path.Offset2 = (ushort)(ushort.MaxValue - destination.Offset); |
| | | 79 | | |
| | 4 | 80 | | cost = (origin.OffsetFactor() - destination.OffsetFactor()) * headToTailCost.cost; |
| | 4 | 81 | | } |
| | | 82 | | |
| | 51 | 83 | | return true; |
| | 83 | 84 | | } |
| | | 85 | | } |