| | | 1 | | using System; |
| | | 2 | | using Itinero.Routes.Paths; |
| | | 3 | | using Itinero.Routing.Costs; |
| | | 4 | | using Itinero.Snapping; |
| | | 5 | | |
| | | 6 | | namespace Itinero.Routing.Flavours.Dijkstra.Bidirectional; |
| | | 7 | | |
| | | 8 | | internal static class DijkstraAlgorithmExtensions |
| | | 9 | | { |
| | | 10 | | public static void Push(this DijkstraAlgorithm dijkstraAlgorithm, ICostFunction costFunction, SnapPoint snapPoint, |
| | | 11 | | bool asOrigin) |
| | 28 | 12 | | { |
| | 28 | 13 | | var enumerator = dijkstraAlgorithm.RoutingNetwork.GetEdgeEnumerator(); |
| | 28 | 14 | | var costEnumerator = new CostEdgeEnumerator(enumerator, costFunction); |
| | | 15 | | |
| | 28 | 16 | | if (asOrigin) |
| | 14 | 17 | | { |
| | 14 | 18 | | var (cost, _) = costEnumerator.MoveToAndGetCost(snapPoint.EdgeId, true, true, []); |
| | 28 | 19 | | if (cost > 0) dijkstraAlgorithm.Push(snapPoint.EdgeId, true, cost * (1 - snapPoint.OffsetFactor())); |
| | | 20 | | |
| | 14 | 21 | | (cost, _) = costEnumerator.MoveToAndGetCost(snapPoint.EdgeId, false, true, []); |
| | 28 | 22 | | if (cost > 0) dijkstraAlgorithm.Push(snapPoint.EdgeId, false, cost * snapPoint.OffsetFactor()); |
| | 14 | 23 | | } |
| | | 24 | | else |
| | 14 | 25 | | { |
| | 14 | 26 | | var (cost, _) = costEnumerator.MoveToAndGetCost(snapPoint.EdgeId, true, false, []); |
| | 28 | 27 | | if (cost > 0) dijkstraAlgorithm.Push(snapPoint.EdgeId, true, cost * (1 - snapPoint.OffsetFactor())); |
| | | 28 | | |
| | 14 | 29 | | (cost, _) = costEnumerator.MoveToAndGetCost(snapPoint.EdgeId, false, false, []); |
| | 28 | 30 | | if (cost > 0) dijkstraAlgorithm.Push(snapPoint.EdgeId, false, cost * snapPoint.OffsetFactor()); |
| | 14 | 31 | | } |
| | 28 | 32 | | } |
| | | 33 | | |
| | | 34 | | public static Path GetPathToVisit(this DijkstraAlgorithm dijkstraAlgorithm, uint p) |
| | 6 | 35 | | { |
| | 6 | 36 | | var path = new Path(dijkstraAlgorithm.RoutingNetwork); |
| | 6 | 37 | | var visit = dijkstraAlgorithm.GetVisit(p); |
| | | 38 | | |
| | 8 | 39 | | while (true) |
| | 8 | 40 | | { |
| | 8 | 41 | | if (visit.previousPointer == uint.MaxValue) |
| | 6 | 42 | | { |
| | 6 | 43 | | path.Prepend(visit.edge, visit.forward); |
| | 6 | 44 | | break; |
| | | 45 | | } |
| | | 46 | | |
| | 2 | 47 | | path.Prepend(visit.edge, visit.forward); |
| | 2 | 48 | | visit = dijkstraAlgorithm.GetVisit(visit.previousPointer); |
| | 2 | 49 | | } |
| | | 50 | | |
| | 6 | 51 | | return path; |
| | 6 | 52 | | } |
| | | 53 | | } |