glax/AStar
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Dequeue either half the queue or max 50 from priority.

Browse Source
This commit is contained in:
glax 2024-07-25 02:22:08 +02:00
parent 55c753adb8
commit 271d84f13f
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
astar/Astar.cs
View File

@ -49,7 +49,7 @@ namespace astar
Node closestEndNode = graph.Nodes[closestEndNodeId]; Node closestEndNode = graph.Nodes[closestEndNodeId];
if (toVisitStart.Count >= toVisitEnd.Count && meetingEnds is null) if (toVisitStart.Count >= toVisitEnd.Count && meetingEnds is null)
{ {
for(int i = 0; i < toVisitStart.Count / 10 && meetingEnds is null; i++) for(int i = 0; i < Math.Min(toVisitStart.Count * 0.5, 50) && meetingEnds is null; i++)
meetingEnds = ExploreSide(true, graph, toVisitStart, rl, priorityHelper, closestEndNode, car, DefaultPriorityWeights, pathing, logger); meetingEnds = ExploreSide(true, graph, toVisitStart, rl, priorityHelper, closestEndNode, car, DefaultPriorityWeights, pathing, logger);
} }
if(meetingEnds is null) if(meetingEnds is null)
@ -60,7 +60,7 @@ namespace astar
Node closestStartNode = graph.Nodes[closestStartNodeId]; Node closestStartNode = graph.Nodes[closestStartNodeId];
if (toVisitEnd.Count >= toVisitStart.Count && meetingEnds is null) if (toVisitEnd.Count >= toVisitStart.Count && meetingEnds is null)
{ {
for(int i = 0; i < toVisitEnd.Count / 10 && meetingEnds is null; i++) for(int i = 0; i < Math.Min(toVisitEnd.Count * 0.5, 50) && meetingEnds is null; i++)
meetingEnds = ExploreSide(false, graph, toVisitEnd, rl, priorityHelper, closestStartNode, car, DefaultPriorityWeights, pathing, logger); meetingEnds = ExploreSide(false, graph, toVisitEnd, rl, priorityHelper, closestStartNode, car, DefaultPriorityWeights, pathing, logger);
} }
if(meetingEnds is null) if(meetingEnds is null)