public void TestCHContractionTest1()
{
//
// (-1/1)---------(-3/2)--------(-5/3)
//
// build the data.
DynamicGraphRouterDataSource<CHEdgeData> data = this.BuildData(
Assembly.GetExecutingAssembly().GetManifestResourceStream(
"OsmSharp.Test.Unittests.Routing.CH.Contraction.contraction_test1.osm"));
// build the witness calculator.
INodeWitnessCalculator witness_calculator = new DykstraWitnessCalculator();
// test the ordering operators.
SparseOrdering sparse_ordering = new SparseOrdering(
data);
Assert.AreEqual(-1, sparse_ordering.Calculate(2));
EdgeDifference edge_difference_ordering = new EdgeDifference(
data, witness_calculator);
Assert.AreEqual(0, edge_difference_ordering.Calculate(2));
// do the actual contraction.
CHPreProcessor pre_processor = new CHPreProcessor(
data, edge_difference_ordering, witness_calculator);
pre_processor.Contract(2);
// check the neighbours of each vertex.
HashSet<uint> neighbours = this.BuildNeighboursSet(data.GetArcs(2));
Assert.IsTrue(neighbours.Contains(1));
Assert.IsTrue(neighbours.Contains(3));
neighbours = this.BuildNeighboursSet(data.GetArcs(1));
Assert.IsTrue(neighbours.Contains(3));
Assert.IsFalse(neighbours.Contains(2));
neighbours = this.BuildNeighboursSet(data.GetArcs(3));
Assert.IsTrue(neighbours.Contains(1));
Assert.IsFalse(neighbours.Contains(2));
}
/// <summary>
/// Creates a router.
/// </summary>
/// <param name="interpreter"></param>
/// <param name="manifestResourceName"></param>
/// <returns></returns>
protected override Router CreateRouter(IOsmRoutingInterpreter interpreter, string manifestResourceName)
{
SimpleTagsIndex tagsIndex = new SimpleTagsIndex();
// do the data processing.
var data = new DynamicGraphRouterDataSource<CHEdgeData>(tagsIndex);
var targetData = new CHEdgeGraphOsmStreamTarget(
data, interpreter, data.TagsIndex, Vehicle.Car);
var dataProcessorSource = new XmlOsmStreamSource(
Assembly.GetExecutingAssembly().GetManifestResourceStream(manifestResourceName));
var sorter = new OsmStreamFilterSort();
sorter.RegisterSource(dataProcessorSource);
targetData.RegisterSource(sorter);
targetData.Pull();
// do the pre-processing part.
var witnessCalculator = new DykstraWitnessCalculator(data);
var preProcessor = new CHPreProcessor(data,
new EdgeDifference(data, witnessCalculator), witnessCalculator);
preProcessor.Start();
//IBasicRouter<LiveEdge> basicRouter = new DykstraRoutingLive(memoryData.TagsIndex);
return Router.CreateCHFrom(data, new CHRouter(data), interpreter);
}
/// <summary>
/// Returns a new router.
/// </summary>
/// <param name="interpreter"></param>
/// <param name="embeddedName"></param>
/// <param name="contract"></param>
/// <returns></returns>
public override Router BuildRouter(IOsmRoutingInterpreter interpreter, string embeddedName, bool contract)
{
if (_data == null)
{
_data = new Dictionary<string, DynamicGraphRouterDataSource<CHEdgeData>>();
}
DynamicGraphRouterDataSource<CHEdgeData> data = null;
if (!_data.TryGetValue(embeddedName, out data))
{
var tagsIndex = new SimpleTagsIndex();
// do the data processing.
data =
new DynamicGraphRouterDataSource<CHEdgeData>(tagsIndex);
var targetData = new CHEdgeGraphOsmStreamTarget(
data, interpreter, tagsIndex, Vehicle.Car);
var dataProcessorSource = new XmlOsmStreamSource(
Assembly.GetExecutingAssembly().GetManifestResourceStream(string.Format(
"OsmSharp.Test.Unittests.{0}", embeddedName)));
var sorter = new OsmStreamFilterSort();
sorter.RegisterSource(dataProcessorSource);
targetData.RegisterSource(sorter);
targetData.Pull();
// do the pre-processing part.
var preProcessor = new CHPreProcessor(data,
new SparseOrdering(data), new DykstraWitnessCalculator());
preProcessor.Start();
_data[embeddedName] = data;
}
return Router.CreateCHFrom(data, new CHRouter(), interpreter);
}
/// <summary>
/// Creates a router.
/// </summary>
/// <param name="interpreter"></param>
/// <param name="manifestResourceName"></param>
/// <returns></returns>
protected override Router CreateRouter(IOsmRoutingInterpreter interpreter, string manifestResourceName)
{
TagsIndex tagsIndex = new TagsIndex();
// do the data processing.
var data = new RouterDataSource<CHEdgeData>(new DirectedGraph<CHEdgeData>(), tagsIndex);
var targetData = new CHEdgeGraphOsmStreamTarget(
data, interpreter, tagsIndex, Vehicle.Car);
var dataProcessorSource = new XmlOsmStreamSource(
Assembly.GetExecutingAssembly().GetManifestResourceStream(manifestResourceName));
var sorter = new OsmStreamFilterSort();
sorter.RegisterSource(dataProcessorSource);
targetData.RegisterSource(sorter);
targetData.Pull();
// do the pre-processing part.
var witnessCalculator = new DykstraWitnessCalculator();
var preProcessor = new CHPreProcessor(data,
new EdgeDifferenceContractedSearchSpace(data, witnessCalculator), witnessCalculator);
preProcessor.Start();
return Router.CreateCHFrom(data, new CHRouter(), interpreter);
}
/// <summary>
/// Builds the edge difference.
/// </summary>
private CHPreProcessor BuildCHPreProcessor(IOsmRoutingInterpreter interpreter)
{
DynamicGraphRouterDataSource<CHEdgeData> data = this.BuildData(interpreter);
// do the pre-processing part.
INodeWitnessCalculator witnessCalculator = new DykstraWitnessCalculator();
var edgeDifference = new EdgeDifference(
data, witnessCalculator);
var preProcessor = new CHPreProcessor(
data, edgeDifference, witnessCalculator);
return preProcessor;
}
/// <summary>
/// Executes the CH contractions while verifying each step.
/// </summary>
/// <param name="stream"></param>
public void DoTestCHEdgeDifferenceVerifiedContraction(Stream stream)
{
_interpreter = new OsmRoutingInterpreter();
var tagsIndex = new TagsIndex();
// do the data processing.
_data = new RouterDataSource<CHEdgeData>(new DirectedGraph<CHEdgeData>(), tagsIndex);
var targetData = new CHEdgeGraphOsmStreamTarget(
_data, _interpreter, tagsIndex, Vehicle.Car);
var dataProcessorSource = new XmlOsmStreamSource(stream);
var sorter = new OsmStreamFilterSort();
sorter.RegisterSource(dataProcessorSource);
targetData.RegisterSource(sorter);
targetData.Pull();
// do the pre-processing part.
var witnessCalculator = new DykstraWitnessCalculator();
var preProcessor = new CHPreProcessor(_data,
new EdgeDifferenceContractedSearchSpace(_data, witnessCalculator), witnessCalculator);
preProcessor.OnBeforeContractionEvent +=
new CHPreProcessor.VertexDelegate(pre_processor_OnBeforeContractionEvent);
preProcessor.OnAfterContractionEvent +=
new CHPreProcessor.VertexDelegate(pre_processor_OnAfterContractionEvent);
preProcessor.Start();
}
/// <summary>
/// Flushes all data.
/// </summary>
public override void Flush()
{
base.Flush();
// compress the graph.
INodeWitnessCalculator witnessCalculator = new DykstraWitnessCalculator();
var edgeDifference = new EdgeDifference(
_graph, witnessCalculator);
var preProcessor = new CHPreProcessor(
_graph, edgeDifference, witnessCalculator);
preProcessor.Start();
// create tags.
TagsCollectionBase metaTags = new TagsCollection();
// create serializer.
var routingSerializer = new CHEdgeDataDataSourceSerializer(true);
routingSerializer.Serialize(_graphStream, _graph, metaTags);
_graphStream.Flush();
}
public void TestVerifiedContraction1NoWitnesses()
{
var graph = new MemoryDirectedGraph<CHEdgeData>();
var vertex1 = graph.AddVertex(1, 0);
var vertex2 = graph.AddVertex(2, 0);
var vertex3 = graph.AddVertex(3, 0);
graph.AddEdge(vertex1, vertex3, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex3, vertex1, new CHEdgeData(1, false, true, true, 10));
graph.AddEdge(vertex2, vertex3, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex3, vertex2, new CHEdgeData(1, false, true, true, 10));
var witnessCalculator = new DykstraWitnessCalculator();
var preProcessor = new CHPreProcessor(graph,
new EdgeDifferenceContractedSearchSpace(graph, witnessCalculator), witnessCalculator);
preProcessor.Contract(3);
// there should be no edge from 1->3 and from 2->3.
Assert.IsFalse(graph.ContainsEdges(1, 3));
Assert.IsFalse(graph.ContainsEdges(2, 3));
var router = new CHRouter();
// expected: (1)-10s-(3)-10s-(2) (20s in total).
var path = router.Calculate(graph, 1, 2);
Assert.IsNotNull(path);
Assert.AreEqual(20, path.Weight);
var pathArray = path.ToArrayWithWeight();
Assert.AreEqual(3, pathArray.Length);
float latitude, longitude;
Assert.AreEqual(0, pathArray[0].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[0].Item1, out latitude, out longitude));
Assert.AreEqual(1, latitude);
Assert.AreEqual(10, pathArray[1].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[1].Item1, out latitude, out longitude));
Assert.AreEqual(3, latitude);
Assert.AreEqual(20, pathArray[2].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[2].Item1, out latitude, out longitude));
Assert.AreEqual(2, latitude);
// expected: (2)-10s-(3)-10s-(1) (20s in total).
path = router.Calculate(graph, 2, 1);
Assert.IsNotNull(path);
Assert.AreEqual(20, path.Weight);
pathArray = path.ToArrayWithWeight();
Assert.AreEqual(3, pathArray.Length);
Assert.AreEqual(0, pathArray[0].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[0].Item1, out latitude, out longitude));
Assert.AreEqual(2, latitude);
Assert.AreEqual(10, pathArray[1].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[1].Item1, out latitude, out longitude));
Assert.AreEqual(3, latitude);
Assert.AreEqual(20, pathArray[2].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[2].Item1, out latitude, out longitude));
Assert.AreEqual(1, latitude);
}
public void TestVerifiedContraction6DuplicateForward()
{
var graph = new MemoryDirectedGraph<CHEdgeData>();
var witnessCalculator = new DykstraWitnessCalculator();
var preProcessor = new CHPreProcessor(graph,
new EdgeDifferenceContractedSearchSpace(graph, witnessCalculator), witnessCalculator);
var vertex1 = graph.AddVertex(1, 0);
var vertex2 = graph.AddVertex(2, 0);
var vertex3 = graph.AddVertex(3, 0);
var vertex4 = graph.AddVertex(4, 0);
graph.AddEdge(vertex1, vertex3, new CHEdgeData(1, true, false, true, 10));
graph.AddEdge(vertex3, vertex1, new CHEdgeData(1, false, true, false, 10));
graph.AddEdge(vertex2, vertex3, new CHEdgeData(1, true, true, false, 10));
graph.AddEdge(vertex3, vertex2, new CHEdgeData(1, false, false, true, 10));
graph.AddEdge(vertex1, vertex4, new CHEdgeData(1, true, true, false, 15));
graph.AddEdge(vertex4, vertex1, new CHEdgeData(1, false, false, true, 15));
graph.AddEdge(vertex2, vertex4, new CHEdgeData(1, true, false, true, 15));
graph.AddEdge(vertex4, vertex2, new CHEdgeData(1, false, true, false, 15));
preProcessor.Contract(3);
Assert.IsTrue(graph.ContainsEdge(vertex1, vertex2, new CHEdgeData(3, false, true, 20)));
Assert.IsTrue(graph.ContainsEdge(vertex2, vertex1, new CHEdgeData(3, true, false, 20)));
preProcessor.Contract(4);
Assert.IsTrue(graph.ContainsEdge(vertex1, vertex2, new CHEdgeData(4, true, false, 30)));
Assert.IsTrue(graph.ContainsEdge(vertex2, vertex1, new CHEdgeData(4, false, true, 30)));
Assert.IsTrue(graph.ContainsEdge(vertex1, vertex2, new CHEdgeData(3, false, true, 20)));
Assert.IsTrue(graph.ContainsEdge(vertex2, vertex1, new CHEdgeData(3, true, false, 20)));
}
public void TestVerifiedContraction4ReplacePrevious()
{
var graph = new MemoryDirectedGraph<CHEdgeData>();
var vertex1 = graph.AddVertex(1, 0);
var vertex2 = graph.AddVertex(2, 0);
var vertex3 = graph.AddVertex(3, 0);
var vertex4 = graph.AddVertex(4, 0);
graph.AddEdge(vertex1, vertex4, new CHEdgeData(1, true, true, true, 15));
graph.AddEdge(vertex4, vertex1, new CHEdgeData(1, false, true, true, 15));
graph.AddEdge(vertex2, vertex4, new CHEdgeData(1, true, true, true, 15));
graph.AddEdge(vertex4, vertex2, new CHEdgeData(1, false, true, true, 15));
var witnessCalculator = new DykstraWitnessCalculator();
var preProcessor = new CHPreProcessor(graph,
new EdgeDifferenceContractedSearchSpace(graph, witnessCalculator), witnessCalculator);
preProcessor.Contract(4);
Assert.IsTrue(graph.ContainsEdge(vertex1, vertex2, new CHEdgeData(4, true, true, 30)));
Assert.IsTrue(graph.ContainsEdge(vertex2, vertex1, new CHEdgeData(4, true, true, 30)));
// add edges later to prevent witnesses from being found!
graph.AddEdge(vertex1, vertex3, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex3, vertex1, new CHEdgeData(1, false, true, true, 10));
graph.AddEdge(vertex2, vertex3, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex3, vertex2, new CHEdgeData(1, false, true, true, 10));
preProcessor.Contract(3);
Assert.IsTrue(graph.ContainsEdge(vertex1, vertex2, new CHEdgeData(3, true, true, 20)));
Assert.IsTrue(graph.ContainsEdge(vertex2, vertex1, new CHEdgeData(3, true, true, 20)));
}
public void TestVerifiedContraction3TinyOneWay()
{
var graph = new MemoryDirectedGraph<CHEdgeData>();
var vertex1 = graph.AddVertex(1, 0);
var vertex2 = graph.AddVertex(2, 0);
var vertex3 = graph.AddVertex(3, 0);
var vertex4 = graph.AddVertex(4, 0);
var vertex5 = graph.AddVertex(5, 0);
graph.AddEdge(vertex1, vertex4, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex4, vertex1, new CHEdgeData(1, false, true, true, 10));
graph.AddEdge(vertex1, vertex2, new CHEdgeData(1, true, true, false, 10)); // oneway forward
graph.AddEdge(vertex2, vertex1, new CHEdgeData(1, false, false, true, 10)); // oneway backward.
graph.AddEdge(vertex1, vertex3, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex3, vertex1, new CHEdgeData(1, false, true, true, 10));
graph.AddEdge(vertex2, vertex3, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex3, vertex2, new CHEdgeData(1, false, true, true, 10));
graph.AddEdge(vertex2, vertex5, new CHEdgeData(1, true, true, true, 10));
graph.AddEdge(vertex5, vertex2, new CHEdgeData(1, false, true, true, 10));
Assert.IsFalse(graph.ContainsEdges(vertex1, vertex1));
Assert.IsTrue(graph.ContainsEdges(vertex2, vertex1));
Assert.IsTrue(graph.ContainsEdges(vertex3, vertex1));
Assert.IsTrue(graph.ContainsEdges(vertex4, vertex1));
Assert.IsFalse(graph.ContainsEdges(vertex5, vertex1));
Assert.IsTrue(graph.ContainsEdges(vertex1, vertex2));
Assert.IsFalse(graph.ContainsEdges(vertex2, vertex2));
Assert.IsTrue(graph.ContainsEdges(vertex3, vertex2));
Assert.IsFalse(graph.ContainsEdges(vertex4, vertex2));
Assert.IsTrue(graph.ContainsEdges(vertex5, vertex2));
Assert.IsTrue(graph.ContainsEdges(vertex1, vertex3));
Assert.IsTrue(graph.ContainsEdges(vertex2, vertex3));
Assert.IsFalse(graph.ContainsEdges(vertex3, vertex3));
Assert.IsFalse(graph.ContainsEdges(vertex4, vertex3));
Assert.IsFalse(graph.ContainsEdges(vertex5, vertex3));
Assert.IsTrue(graph.ContainsEdges(vertex1, vertex4));
Assert.IsFalse(graph.ContainsEdges(vertex2, vertex4));
Assert.IsFalse(graph.ContainsEdges(vertex3, vertex4));
Assert.IsFalse(graph.ContainsEdges(vertex4, vertex4));
Assert.IsFalse(graph.ContainsEdges(vertex5, vertex4));
Assert.IsFalse(graph.ContainsEdges(vertex1, vertex5));
Assert.IsTrue(graph.ContainsEdges(vertex2, vertex5));
Assert.IsFalse(graph.ContainsEdges(vertex3, vertex5));
Assert.IsFalse(graph.ContainsEdges(vertex4, vertex5));
Assert.IsFalse(graph.ContainsEdges(vertex5, vertex5));
var witnessCalculator = new DykstraWitnessCalculator();
var preProcessor = new CHPreProcessor(graph,
new EdgeDifferenceContractedSearchSpace(graph, witnessCalculator), witnessCalculator);
preProcessor.Start();
var router = new CHRouter();
// expected: (4)-10s-(1)-10s-(2)-10s-(3) (30s in total).
var path = router.Calculate(graph, 4, 5);
Assert.IsNotNull(path);
Assert.AreEqual(30, path.Weight);
var pathArray = path.ToArrayWithWeight();
Assert.AreEqual(4, pathArray.Length);
float latitude, longitude;
Assert.AreEqual(0, pathArray[0].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[0].Item1, out latitude, out longitude));
Assert.AreEqual(4, latitude);
Assert.AreEqual(10, pathArray[1].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[1].Item1, out latitude, out longitude));
Assert.AreEqual(1, latitude);
Assert.AreEqual(20, pathArray[2].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[2].Item1, out latitude, out longitude));
Assert.AreEqual(2, latitude);
Assert.AreEqual(30, pathArray[3].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[3].Item1, out latitude, out longitude));
Assert.AreEqual(5, latitude);
// expected: (5)-10s-(2)-10s-(3)-10s-(1)-10s-(4) (40s in total).
path = router.Calculate(graph, 5, 4);
Assert.IsNotNull(path);
Assert.AreEqual(40, path.Weight);
pathArray = path.ToArrayWithWeight();
Assert.AreEqual(5, pathArray.Length);
Assert.AreEqual(0, pathArray[0].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[0].Item1, out latitude, out longitude));
Assert.AreEqual(5, latitude);
Assert.AreEqual(10, pathArray[1].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[1].Item1, out latitude, out longitude));
Assert.AreEqual(2, latitude);
Assert.AreEqual(20, pathArray[2].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[2].Item1, out latitude, out longitude));
Assert.AreEqual(3, latitude);
Assert.AreEqual(30, pathArray[3].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[3].Item1, out latitude, out longitude));
Assert.AreEqual(1, latitude);
Assert.AreEqual(40, pathArray[4].Item2);
Assert.IsTrue(graph.GetVertex((uint)pathArray[4].Item1, out latitude, out longitude));
Assert.AreEqual(4, latitude);
}
/// <summary>
/// Executes the CH contractions while verifying each step.
/// </summary>
/// <param name="stream"></param>
public void DoTestCHSparseVerifiedContraction(Stream stream)
{
_interpreter = new OsmRoutingInterpreter();
OsmTagsIndex tags_index = new OsmTagsIndex();
// do the data processing.
_data = new DynamicGraphRouterDataSource<CHEdgeData>(tags_index);
CHEdgeDataGraphProcessingTarget target_data = new CHEdgeDataGraphProcessingTarget(
_data, _interpreter, _data.TagsIndex, VehicleEnum.Car);
XmlDataProcessorSource data_processor_source = new XmlDataProcessorSource(stream);
DataProcessorFilterSort sorter = new DataProcessorFilterSort();
sorter.RegisterSource(data_processor_source);
target_data.RegisterSource(sorter);
target_data.Pull();
// do the pre-processing part.
//INodeWitnessCalculator witness_calculator = new CHRouterWitnessCalculator(_data);
INodeWitnessCalculator witness_calculator = new DykstraWitnessCalculator(_data);
CHPreProcessor pre_processor = new CHPreProcessor(_data,
new EdgeDifferenceContractedSearchSpace(_data, witness_calculator), witness_calculator);
pre_processor.OnBeforeContractionEvent += new CHPreProcessor.VertexDelegate(pre_processor_OnBeforeContractionEvent);
pre_processor.OnAfterContractionEvent += new CHPreProcessor.VertexDelegate(pre_processor_OnAfterContractionEvent);
pre_processor.Start();
}
/// <summary>
/// Returns a new router.
/// </summary>
/// <param name="interpreter"></param>
/// <param name="embedded_name"></param>
/// <returns></returns>
public override IRouter<RouterPoint> BuildRouter(IRoutingInterpreter interpreter, string embedded_name)
{
if (_data == null)
{
_data = new Dictionary<string, DynamicGraphRouterDataSource<CHEdgeData>>();
}
DynamicGraphRouterDataSource<CHEdgeData> data = null;
if (!_data.TryGetValue(embedded_name, out data))
{
OsmTagsIndex tags_index = new OsmTagsIndex();
// do the data processing.
data =
new DynamicGraphRouterDataSource<CHEdgeData>(tags_index);
CHEdgeDataGraphProcessingTarget target_data = new CHEdgeDataGraphProcessingTarget(
data, interpreter, data.TagsIndex, VehicleEnum.Car);
XmlDataProcessorSource data_processor_source = new XmlDataProcessorSource(
Assembly.GetExecutingAssembly().GetManifestResourceStream(string.Format(
"OsmSharp.UnitTests.{0}", embedded_name)));
DataProcessorFilterSort sorter = new DataProcessorFilterSort();
sorter.RegisterSource(data_processor_source);
target_data.RegisterSource(sorter);
target_data.Pull();
// do the pre-processing part.
CHPreProcessor pre_processor = new CHPreProcessor(data,
new SparseOrdering(data), new DykstraWitnessCalculator(data));
pre_processor.Start();
_data[embedded_name] = data;
}
return new Router<CHEdgeData>(data, interpreter, new CHRouter(
data));
}
