Update docs/apworld_dev_faq.md

Co-authored-by: Scipio Wright <scipiowright@gmail.com>
This commit is contained in:
NewSoupVi
2024-08-13 18:18:55 +02:00
committed by GitHub
parent 850033b311
commit e74e472e3f

View File

@@ -53,7 +53,7 @@ The world API document mentions indirect conditions and **when** you should use
Region sweep (the algorithm that determines which regions are reachable) is a Breadth First Search of the region graph from the Menu region, checking entrances one by one and adding newly reached nodes (regions) and their entrances to the queue until there is nothing more to check.
However, if entrance access conditions depend on regions, then it is possible for this to happen:
1. An entrance that depends on a region is checked and determined to be untraversable because the region hasn't been reached yet during the graph search.
1. An entrance that depends on a region is checked and determined to be nontraversable because the region hasn't been reached yet during the graph search.
2. After that, the region is reached by the graph search. The entrance *would* now be determined to be traversable if it were rechecked.
To account for this case, we would have to recheck all entrances every time a new region is reached, until no new regions are reached.