DBot/overdrive_that_matters
DBot/overdrive_that_matters
3
1
Fork 0
Code Issues 63 Pull Requests Packages Releases Wiki Activity

Improve cable path search performance when there are a lot of paths existing already

Browse Source
This commit is contained in:
DBotThePony 2025-02-11 11:12:11 +07:00
parent 590f420c07
commit 89ca0fbce8
Signed by: DBot
GPG Key ID: DCC23B5715498507
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/main/kotlin/ru/dbotthepony/mc/otm/block/entity/cable/EnergyCableGraph.kt
View File

@ -426,6 +426,9 @@ class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableG
openNodes.add(SearchNode(a, b, null, seenTop)) openNodes.add(SearchNode(a, b, null, seenTop))
val existingNodes = HashSet<EnergyCableBlockEntity.Node>()
existing.forEach { existingNodes.addAll(it.nodes) }
while (openNodes.isNotEmpty()) { while (openNodes.isNotEmpty()) {
val first = openNodes.remove() val first = openNodes.remove()
openNodes.remove(first) openNodes.remove(first)
@ -466,7 +469,7 @@ class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableG
} else { } else {
for (neighbour in first.node.neighboursView.values) { for (neighbour in first.node.neighboursView.values) {
if (!seenNodes.add(neighbour) || !neighbour.canTraverse) continue if (!seenNodes.add(neighbour) || !neighbour.canTraverse) continue
val seen = existing.any { neighbour in it } val seen = neighbour in existingNodes
if (seen && neighbour.energyThroughput <= threshold) continue if (seen && neighbour.energyThroughput <= threshold) continue
openNodes.add(SearchNode(neighbour, b, first, seen)) openNodes.add(SearchNode(neighbour, b, first, seen))
} }