Skip to content

Commit

Permalink
Removed hard limit on search spaces.
Browse files Browse the repository at this point in the history
  • Loading branch information
xivk committed Mar 19, 2024
1 parent db0e353 commit fe6ce3b
Show file tree
Hide file tree
Showing 3 changed files with 1 addition and 15 deletions.
2 changes: 1 addition & 1 deletion Itinero.Common.props
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@

<!--- Package information, Version -->
<PropertyGroup>
<PackageVersion>2.0.1-alpha-103</PackageVersion>
<PackageVersion>2.0.1-alpha-104</PackageVersion>
<NeutralLanguage>en</NeutralLanguage>
<Description>Itinero - Routeplanning for .NET.</Description>
<Copyright>Itinero BV</Copyright>
Expand Down
7 changes: 0 additions & 7 deletions src/Itinero/Routing/Flavours/Dijkstra/Dijkstra.cs
Original file line number Diff line number Diff line change
Expand Up @@ -185,13 +185,6 @@ static double GetWorst((uint pointer, double cost)[] targets)
// keep going until heap is empty.
while (_heap.Count > 0)
{
if (_visits.Count > 1 << 20)
{
// TODO: come up with a stop condition that makes more sense to prevent the global network being loaded
// when a route is not found.
break;
}

// dequeue new visit.
var currentPointer = _heap.Pop(out var currentCost);
var currentVisit = _tree.GetVisit(currentPointer);
Expand Down
7 changes: 0 additions & 7 deletions src/Itinero/Routing/Flavours/Dijkstra/EdgeBased/Dijkstra.cs
Original file line number Diff line number Diff line change
Expand Up @@ -253,13 +253,6 @@ static double GetWorst((uint pointer, double cost)[] targets)
// keep going until heap is empty.
while (_heap.Count > 0)
{
if (_visits.Count > 1 << 20)
{
// TODO: come up with a stop condition that makes more sense to prevent the global network being loaded
// when a route is not found.
break;
}

// dequeue new visit.
var currentPointer = _heap.Pop(out var currentCost);
var currentVisit = _tree.GetVisit(currentPointer);
Expand Down

0 comments on commit fe6ce3b

Please sign in to comment.