Mirrors/Unciv
1
0
Fork 0
mirror of https://github.com/yairm210/Unciv.git synced 2025-02-20 19:56:51 +01:00
Code Issues Packages Projects Releases Wiki Activity

Simplified BFS.getPathTo()

Browse Source
This commit is contained in:
Yair Morgenstern 2019-07-12 15:40:03 +03:00
parent d9942aec7c
commit 0fe3de0d50
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
core/src/com/unciv/logic/map/BFS.kt
View File

@ -39,11 +39,11 @@ class BFS(val startingPoint: TileInfo, val predicate : (TileInfo) -> Boolean){
val path = ArrayList<TileInfo>()
path.add(destination)
var currentNode = destination
while(currentNode != startingPoint){
tilesReached[currentNode]?.let {
currentNode = it
path.add(currentNode)
} ?: return ArrayList() // destination is not in our path
while(currentNode != startingPoint) {
val parent = tilesReached[currentNode]
if (parent == null) return ArrayList()// destination is not in our path
currentNode = parent
path.add(currentNode)
}
return path
}