public void TestPentagonAugmented()
{
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.DynamicAugmentedFixedSize);
graph.AddEdge(0, 1, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(1, 0, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(1, 2, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(2, 1, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(2, 3, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(3, 2, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(3, 4, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(4, 3, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(4, 0, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.AddEdge(0, 4, 100, null, Constants.NO_VERTEX, 50, 1000);
graph.Compress();
// contract graph.
var priorityCalculator = new EdgeDifferencePriorityCalculator(graph, new DykstraWitnessCalculator(int.MaxValue));
priorityCalculator.ContractedFactor = 0;
priorityCalculator.DepthFactor = 0;
var hierarchyBuilder = new HierarchyBuilder <Weight>(graph, priorityCalculator,
new DykstraWitnessCalculator(int.MaxValue), new WeightHandler(null));
hierarchyBuilder.Run();
// check edges.
var edges01 = graph.GetEdgeEnumerator(0).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges01);
var edges10 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 0);
Assert.IsNull(edges10);
var edges12 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNull(edges12);
var edges21 = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges21);
var edges23 = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNotNull(edges23);
var edges32 = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNull(edges32);
var edges34 = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 4);
Assert.IsNull(edges34);
var edges43 = graph.GetEdgeEnumerator(4).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNotNull(edges43);
var edges40 = graph.GetEdgeEnumerator(4).FirstOrDefault(x => x.Neighbour == 0);
Assert.IsNull(edges40);
var edges04 = graph.GetEdgeEnumerator(0).FirstOrDefault(x => x.Neighbour == 4);
Assert.IsNotNull(edges04);
var edges41 = graph.GetEdgeEnumerator(4).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges41);
var edges14 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 4);
Assert.IsNull(edges14);
var edges31 = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges31);
var edges13 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNull(edges13);
}
/// <summary>
/// Add edge.
/// </summary>
/// <returns></returns>
public static void AddEdge(this DirectedMetaGraph graph, uint vertex1, uint vertex2, float weight,
bool?direction, uint contractedId)
{
graph.AddEdge(vertex1, vertex2, ContractedEdgeDataSerializer.Serialize(
weight, direction), contractedId);
}
public void TestPentagon()
{
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, null, Constants.NO_VERTEX);
graph.AddEdge(0, 4, 100, null, Constants.NO_VERTEX);
graph.AddEdge(2, 1, 100, null, Constants.NO_VERTEX);
graph.AddEdge(2, 3, 100, null, Constants.NO_VERTEX);
graph.AddEdge(3, 1, 200, null, 2);
graph.AddEdge(4, 1, 200, null, 0);
graph.AddEdge(4, 3, 100, null, Constants.NO_VERTEX);
// create algorithm and run.
var algorithm = new Itinero.Algorithms.Contracted.BidirectionalDykstra(graph,
new EdgePath <float>[] { new EdgePath <float>(0) }, new EdgePath <float>[] { new EdgePath <float>(2) });
algorithm.Run();
// check results.
Assert.IsTrue(algorithm.HasRun);
Assert.IsTrue(algorithm.HasSucceeded);
Assert.AreEqual(1, algorithm.Best);
EdgePath <float> visit;
Assert.IsTrue(algorithm.TryGetForwardVisit(0, out visit));
Assert.AreEqual(0, visit.Weight);
Assert.AreEqual(0, visit.Vertex);
Assert.AreEqual(null, visit.From);
Assert.IsTrue(algorithm.TryGetForwardVisit(1, out visit));
Assert.AreEqual(100, visit.Weight);
Assert.AreEqual(1, visit.Vertex);
Assert.IsNotNull(visit.From);
Assert.AreEqual(0, visit.From.Vertex);
Assert.IsTrue(algorithm.TryGetBackwardVisit(2, out visit));
Assert.AreEqual(0, visit.Weight);
Assert.AreEqual(2, visit.Vertex);
Assert.AreEqual(null, visit.From);
Assert.IsTrue(algorithm.TryGetBackwardVisit(1, out visit));
Assert.AreEqual(100, visit.Weight);
Assert.AreEqual(1, visit.Vertex);
Assert.IsNotNull(visit.From);
Assert.AreEqual(2, visit.From.Vertex);
Assert.AreEqual(new List <uint>(new uint[] { 0, 1, 2 }), algorithm.GetPath());
// create algorithm and run.
algorithm = new Itinero.Algorithms.Contracted.BidirectionalDykstra(graph,
new EdgePath <float>[] { new EdgePath <float>(1) }, new EdgePath <float>[] { new EdgePath <float>(3) });
algorithm.Run();
// check results.
Assert.IsTrue(algorithm.HasRun);
Assert.IsTrue(algorithm.HasSucceeded);
Assert.AreEqual(1, algorithm.Best);
Assert.IsTrue(algorithm.TryGetForwardVisit(1, out visit));
Assert.AreEqual(0, visit.Weight);
Assert.AreEqual(1, visit.Vertex);
Assert.AreEqual(null, visit.From);
Assert.IsTrue(algorithm.TryGetBackwardVisit(1, out visit));
Assert.AreEqual(200, visit.Weight);
Assert.AreEqual(1, visit.Vertex);
Assert.AreEqual(3, visit.From.Vertex);
Assert.IsTrue(algorithm.TryGetBackwardVisit(3, out visit));
Assert.AreEqual(0, visit.Weight);
Assert.AreEqual(3, visit.Vertex);
Assert.IsNull(visit.From);
Assert.AreEqual(new List <uint>(new uint[] { 1, 2, 3 }), algorithm.GetPath());
// create algorithm and run.
algorithm = new Itinero.Algorithms.Contracted.BidirectionalDykstra(graph,
new EdgePath <float>[] { new EdgePath <float>(3) }, new EdgePath <float>[] { new EdgePath <float>(1) });
algorithm.Run();
// check results.
Assert.IsTrue(algorithm.HasRun);
Assert.IsTrue(algorithm.HasSucceeded);
Assert.AreEqual(1, algorithm.Best);
Assert.IsTrue(algorithm.TryGetForwardVisit(1, out visit));
Assert.AreEqual(200, visit.Weight);
Assert.AreEqual(1, visit.Vertex);
Assert.AreEqual(3, visit.From.Vertex);
Assert.IsTrue(algorithm.TryGetForwardVisit(3, out visit));
Assert.AreEqual(0, visit.Weight);
Assert.AreEqual(3, visit.Vertex);
Assert.IsNull(visit.From);
Assert.IsTrue(algorithm.TryGetBackwardVisit(1, out visit));
Assert.AreEqual(0, visit.Weight);
Assert.AreEqual(1, visit.Vertex);
Assert.AreEqual(null, visit.From);
Assert.AreEqual(new List <uint>(new uint[] { 3, 2, 1 }), algorithm.GetPath());
}
public void TestDoubleContractionOneway()
{
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 2, 100, true, Constants.NO_VERTEX);
graph.AddEdge(2, 0, 100, false, Constants.NO_VERTEX);
graph.AddEdge(0, 3, 10, false, Constants.NO_VERTEX);
graph.AddEdge(3, 0, 10, true, Constants.NO_VERTEX);
graph.AddEdge(1, 2, 1000, false, Constants.NO_VERTEX);
graph.AddEdge(2, 1, 1000, true, Constants.NO_VERTEX);
graph.AddEdge(1, 3, 10000, true, Constants.NO_VERTEX);
graph.AddEdge(3, 1, 10000, false, Constants.NO_VERTEX);
graph.Compress();
// contract graph.
var priorityCalculator = new EdgeDifferencePriorityCalculator(graph, new DykstraWitnessCalculator(int.MaxValue));
priorityCalculator.ContractedFactor = 0;
priorityCalculator.DepthFactor = 0;
var hierarchyBuilder = new HierarchyBuilder(graph, priorityCalculator,
new DykstraWitnessCalculator(int.MaxValue));
hierarchyBuilder.Run();
// check edges.
var edge = graph.GetEdgeEnumerator(0).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNotNull(edge);
var edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(100, edgeData.Weight);
Assert.AreEqual(true, edgeData.Direction);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
edge = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 0);
Assert.IsNull(edge);
edge = graph.GetEdgeEnumerator(0).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(10, edgeData.Weight);
Assert.AreEqual(false, edgeData.Direction);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
edge = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 0);
Assert.IsNull(edge);
edge = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(110, edgeData.Weight);
Assert.AreEqual(false, edgeData.Direction);
Assert.AreEqual(0, edgeData.ContractedId);
edge = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNull(edge);
edge = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(1000, edgeData.Weight);
Assert.AreEqual(true, edgeData.Direction);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
edge = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNull(edge);
edge = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == true);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(1110, edgeData.Weight);
Assert.AreEqual(2, edgeData.ContractedId);
edge = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == false);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(10000, edgeData.Weight);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
edge = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNull(edge);
}
/// <summary> /// Adds or updates an edge. /// </summary> public abstract void AddOrUpdateEdge(DirectedMetaGraph graph, uint vertex1, uint vertex2, uint contractedId, bool?direction, T weight);
/// <summary>
/// Creates a new contracted bidirectional router.
/// </summary>
public BidirectionalDykstra(DirectedMetaGraph graph, WeightHandler <T> weightHandler, uint source, uint target)
: this(graph, weightHandler, new DykstraSource <T>(source), new DykstraSource <T>(target))
{
}
public void TestTwoEdgesLeftMiddleHighest()
{
// build graph.
var oneway = VehicleMock.Car(t => new FactorAndSpeed()
{
Value = VehicleMock.Car().Fastest().FactorAndSpeed(null).Value,
SpeedFactor = VehicleMock.Car().Fastest().FactorAndSpeed(null).SpeedFactor,
Direction = 1
}).Fastest();
var routerDb = new RouterDb();
routerDb.AddSupportedVehicle(oneway.Parent);
routerDb.Network.AddVertex(0, 0, 0);
routerDb.Network.AddVertex(1, 1, 1);
routerDb.Network.AddVertex(2, 2, 2);
routerDb.Network.AddEdge(0, 1, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
routerDb.Network.AddEdge(1, 2, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(1, 0, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, false, Constants.NO_VERTEX);
graph.AddEdge(2, 1, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, false, Constants.NO_VERTEX);
routerDb.AddContracted(VehicleMock.Car().Fastest(), new ContractedDb(graph));
// create algorithm and run.
var algorithm = new ManyToManyWeightsBidirectionalDykstra(new Router(routerDb), oneway,
new RouterPoint[] {
routerDb.Network.CreateRouterPointForVertex(0),
routerDb.Network.CreateRouterPointForVertex(1),
routerDb.Network.CreateRouterPointForVertex(2)
},
new RouterPoint[] {
routerDb.Network.CreateRouterPointForVertex(0),
routerDb.Network.CreateRouterPointForVertex(1),
routerDb.Network.CreateRouterPointForVertex(2)
});
algorithm.Run();
// check results.
Assert.IsTrue(algorithm.HasRun);
Assert.IsTrue(algorithm.HasSucceeded);
Assert.IsNotNull(algorithm.Weights);
Assert.AreEqual(3, algorithm.Weights.Length);
Assert.AreEqual(3, algorithm.Weights[0].Length);
Assert.AreEqual(3, algorithm.Weights[1].Length);
Assert.AreEqual(3, algorithm.Weights[2].Length);
Assert.AreEqual(000 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][0], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][1], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][2], 0.1);
Assert.AreEqual(float.MaxValue, algorithm.Weights[1][0]);
Assert.AreEqual(000 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][1], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][2], 0.1);
Assert.AreEqual(float.MaxValue, algorithm.Weights[2][0]);
Assert.AreEqual(float.MaxValue, algorithm.Weights[2][1]);
Assert.AreEqual(000 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[2][2], 0.1);
}
public void TestPentagon()
{
var routerDb = new RouterDb();
routerDb.AddSupportedVehicle(VehicleMock.Car());
routerDb.Network.AddVertex(0, 0, 0);
routerDb.Network.AddVertex(1, 1, 1);
routerDb.Network.AddVertex(2, 2, 2);
routerDb.Network.AddVertex(3, 3, 3);
routerDb.Network.AddVertex(4, 4, 4);
routerDb.Network.AddEdge(0, 1, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
routerDb.Network.AddEdge(1, 2, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
routerDb.Network.AddEdge(2, 3, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
routerDb.Network.AddEdge(3, 4, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
routerDb.Network.AddEdge(4, 0, new Itinero.Data.Network.Edges.EdgeData()
{
Distance = 100,
Profile = 0,
MetaId = 0
});
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, Constants.NO_VERTEX);
graph.AddEdge(0, 4, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, Constants.NO_VERTEX);
graph.AddEdge(2, 1, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, Constants.NO_VERTEX);
graph.AddEdge(2, 3, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, Constants.NO_VERTEX);
graph.AddEdge(3, 1, 200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, 2);
graph.AddEdge(4, 1, 200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, 0);
graph.AddEdge(4, 3, 100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, null, Constants.NO_VERTEX);
routerDb.AddContracted(VehicleMock.Car().Fastest(), new ContractedDb(graph));
// create algorithm and run.
var algorithm = new ManyToManyWeightsBidirectionalDykstra(new Router(routerDb), VehicleMock.Car().Fastest(),
new RouterPoint[] {
routerDb.Network.CreateRouterPointForVertex(0),
routerDb.Network.CreateRouterPointForVertex(1),
routerDb.Network.CreateRouterPointForVertex(2),
routerDb.Network.CreateRouterPointForVertex(3),
routerDb.Network.CreateRouterPointForVertex(4)
},
new RouterPoint[] {
routerDb.Network.CreateRouterPointForVertex(0),
routerDb.Network.CreateRouterPointForVertex(1),
routerDb.Network.CreateRouterPointForVertex(2),
routerDb.Network.CreateRouterPointForVertex(3),
routerDb.Network.CreateRouterPointForVertex(4)
});
algorithm.Run();
// check results.
Assert.IsTrue(algorithm.HasRun);
Assert.IsTrue(algorithm.HasSucceeded);
Assert.IsNotNull(algorithm.Weights);
Assert.AreEqual(5, algorithm.Weights.Length);
Assert.AreEqual(5, algorithm.Weights[0].Length);
Assert.AreEqual(5, algorithm.Weights[1].Length);
Assert.AreEqual(5, algorithm.Weights[2].Length);
Assert.AreEqual(5, algorithm.Weights[3].Length);
Assert.AreEqual(5, algorithm.Weights[4].Length);
Assert.AreEqual(000 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][0], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][1], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][2], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][3], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[0][4], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][0], 0.1);
Assert.AreEqual(000 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][1], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][2], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][3], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[1][4], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[2][0], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[2][1], 0.1);
Assert.AreEqual(000 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[2][2], 0.1);
Assert.AreEqual(100 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[2][3], 0.1);
Assert.AreEqual(200 * VehicleMock.Car().Fastest().FactorAndSpeed(null).Value, algorithm.Weights[2][4], 0.1);
}
public void TestOneEdgeAugmented()
{
// build graph.
var graph = new Itinero.Graphs.Graph(EdgeDataSerializer.Size);
graph.AddVertex(0);
graph.AddVertex(1);
graph.AddEdge(0, 1, EdgeDataSerializer.Serialize(new EdgeData()
{
Distance = 100,
Profile = 1
}));
// build speed profile function.
var speed = 100f / 3.6f;
Func <ushort, FactorAndSpeed> getFactor = (x) =>
{
return(new FactorAndSpeed()
{
Direction = 0,
SpeedFactor = 1.0f / speed,
Value = 1.0f / speed
});
};
// convert graph.
var directedGraph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaAugmentedSize);
var algorithm = new DirectedGraphBuilder <Weight>(graph, directedGraph, new WeightHandler(getFactor));
algorithm.Run();
// check result.
Assert.IsTrue(algorithm.HasRun);
Assert.IsTrue(algorithm.HasSucceeded);
directedGraph.Compress();
Assert.AreEqual(2, directedGraph.VertexCount);
Assert.AreEqual(2, directedGraph.EdgeCount);
// verify all edges.
var edges = directedGraph.GetEdgeEnumerator(0);
Assert.AreEqual(1, edges.Count);
var data = ContractedEdgeDataSerializer.Serialize(100 * getFactor(1).Value, null);
var metaData = ContractedEdgeDataSerializer.SerializeMetaAugmented(Constants.NO_VERTEX, 100, 100 * getFactor(1).Value);
Assert.AreEqual(data, edges.First().Data[0]);
Assert.AreEqual(metaData[0], edges.First().MetaData[0]);
Assert.AreEqual(metaData[1], edges.First().MetaData[1]);
Assert.AreEqual(metaData[2], edges.First().MetaData[2]);
Assert.AreEqual(1, edges.First().Neighbour);
edges = directedGraph.GetEdgeEnumerator(1);
Assert.AreEqual(1, edges.Count);
data = ContractedEdgeDataSerializer.Serialize(100 * getFactor(1).Value, null);
metaData = ContractedEdgeDataSerializer.SerializeMetaAugmented(Constants.NO_VERTEX, 100, 100 * getFactor(1).Value);
Assert.AreEqual(data, edges.First().Data[0]);
Assert.AreEqual(metaData[0], edges.First().MetaData[0]);
Assert.AreEqual(metaData[1], edges.First().MetaData[1]);
Assert.AreEqual(metaData[2], edges.First().MetaData[2]);
Assert.AreEqual(0, edges.First().Neighbour);
}
/// <summary>
/// Creates a new routing algorithm instance.
/// </summary>
public Dykstra(DirectedMetaGraph graph, WeightHandler <T> weightHandler, uint source, bool backward, T max)
: this(graph, weightHandler, new DykstraSource <T>(source), backward, max)
{
}
public override void AddOrUpdateEdge(DirectedMetaGraph graph, uint vertex1, uint vertex2, uint contractedId, bool?direction, float weight)
{
throw new NotImplementedException();
}
public void TestAddOrUpdateEdge()
{
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, null, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 99, null, Constants.NO_VERTEX);
// check result.
var edges = new List <MetaEdge>(graph.GetEdgeEnumerator(0).Where(x => x.Neighbour == 1));
Assert.AreEqual(1, edges.Count);
Assert.AreEqual(1, edges[0].Neighbour);
var edgeData = ContractedEdgeDataSerializer.Deserialize(edges[0].Data[0], edges[0].MetaData[0]);
Assert.AreEqual(null, edgeData.Direction);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(99, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, null, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 101, null, Constants.NO_VERTEX);
// check result.
edges = new List <MetaEdge>(graph.GetEdgeEnumerator(0).Where(x => x.Neighbour == 1));
Assert.AreEqual(1, edges.Count);
Assert.AreEqual(1, edges[0].Neighbour);
edgeData = ContractedEdgeDataSerializer.Deserialize(edges[0].Data[0], edges[0].MetaData[0]);
Assert.AreEqual(null, edgeData.Direction);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(100, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, true, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 99, true, Constants.NO_VERTEX);
// check result.
edges = new List <MetaEdge>(graph.GetEdgeEnumerator(0).Where(x => x.Neighbour == 1));
Assert.AreEqual(1, edges.Count);
Assert.AreEqual(1, edges[0].Neighbour);
edgeData = ContractedEdgeDataSerializer.Deserialize(edges[0].Data[0], edges[0].MetaData[0]);
Assert.AreEqual(true, edgeData.Direction);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(99, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, null, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 99, true, Constants.NO_VERTEX);
// check result.
var edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == false);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(100, edgeData.Weight);
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == true);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(99, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, false, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 99, true, Constants.NO_VERTEX);
// check result.
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == false);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(100, edgeData.Weight);
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == true);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(99, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, false, Constants.NO_VERTEX);
graph.AddEdge(0, 1, 99, true, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 98, null, Constants.NO_VERTEX);
// check result.
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == null);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(98, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, false, Constants.NO_VERTEX);
graph.AddEdge(0, 1, 98, true, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 1, 99, null, Constants.NO_VERTEX);
// check result.
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == false);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(99, edgeData.Weight);
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 1 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == true);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(98, edgeData.Weight);
// build graph.
graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, null, Constants.NO_VERTEX);
// update.
graph.AddOrUpdateEdge(0, 2, 99, null, Constants.NO_VERTEX);
// check result.
edge = graph.GetEdgeEnumerator(0).First(x => x.Neighbour == 2 &&
ContractedEdgeDataSerializer.Deserialize(x.Data[0], x.MetaData[0]).Direction == null);
Assert.IsNotNull(edge);
edgeData = ContractedEdgeDataSerializer.Deserialize(edge.Data[0], edge.MetaData[0]);
Assert.AreEqual(Constants.NO_VERTEX, edgeData.ContractedId);
Assert.AreEqual(99, edgeData.Weight);
}
public void TestPentagonDirected()
{
// build graph.
var graph = new DirectedMetaGraph(ContractedEdgeDataSerializer.Size,
ContractedEdgeDataSerializer.MetaSize);
graph.AddEdge(0, 1, 100, true, Constants.NO_VERTEX);
graph.AddEdge(1, 0, 100, false, Constants.NO_VERTEX);
graph.AddEdge(1, 2, 100, true, Constants.NO_VERTEX);
graph.AddEdge(2, 1, 100, false, Constants.NO_VERTEX);
graph.AddEdge(2, 3, 100, true, Constants.NO_VERTEX);
graph.AddEdge(3, 2, 100, false, Constants.NO_VERTEX);
graph.AddEdge(3, 4, 100, true, Constants.NO_VERTEX);
graph.AddEdge(4, 3, 100, false, Constants.NO_VERTEX);
graph.AddEdge(4, 0, 100, true, Constants.NO_VERTEX);
graph.AddEdge(0, 4, 100, false, Constants.NO_VERTEX);
graph.Compress();
// contract graph.
var hierarchyBuilder = new Itinero.Algorithms.Contracted.Dual.HierarchyBuilder(graph,
new DykstraWitnessCalculator(graph.Graph, int.MaxValue));
hierarchyBuilder.ContractedFactor = 0;
hierarchyBuilder.DepthFactor = 0;
hierarchyBuilder.Run();
// check edges.
var edges01 = graph.GetEdgeEnumerator(0).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges01);
var edges10 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 0);
Assert.IsNull(edges10);
var edges12 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNull(edges12);
var edges21 = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges21);
var edges23 = graph.GetEdgeEnumerator(2).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNotNull(edges23);
var edges32 = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 2);
Assert.IsNull(edges32);
var edges34 = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 4);
Assert.IsNull(edges34);
var edges43 = graph.GetEdgeEnumerator(4).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNotNull(edges43);
var edges40 = graph.GetEdgeEnumerator(4).FirstOrDefault(x => x.Neighbour == 0);
Assert.IsNull(edges40);
var edges04 = graph.GetEdgeEnumerator(0).FirstOrDefault(x => x.Neighbour == 4);
Assert.IsNotNull(edges04);
var edges41 = graph.GetEdgeEnumerator(4).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges41);
var edges14 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 4);
Assert.IsNull(edges14);
var edges31 = graph.GetEdgeEnumerator(3).FirstOrDefault(x => x.Neighbour == 1);
Assert.IsNotNull(edges31);
var edges13 = graph.GetEdgeEnumerator(1).FirstOrDefault(x => x.Neighbour == 3);
Assert.IsNull(edges13);
}
public BidirectionalDykstra(DirectedMetaGraph graph, IEnumerable <Path> sources, IEnumerable <Path> targets)
{
this._graph = graph;
this._sources = sources;
this._targets = targets;
}
/// <summary>
/// Checks if the given graph can be used with the weight handler.
/// </summary>
public static void CheckCanUse <T>(this WeightHandler <T> weightHandler, DirectedMetaGraph graph)
where T : struct
{
weightHandler.CheckCanUse(new ContractedDb(graph));
}
