From 8cefe85630c02d8a4af34301dee7d5fc03a18f85 Mon Sep 17 00:00:00 2001 From: NewSoupVi <57900059+NewSoupVi@users.noreply.github.com> Date: Thu, 5 Sep 2024 21:20:51 +0200 Subject: [PATCH] Update docs/apworld_dev_faq.md Co-authored-by: Exempt-Medic <60412657+Exempt-Medic@users.noreply.github.com> --- docs/apworld_dev_faq.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/apworld_dev_faq.md b/docs/apworld_dev_faq.md index 4221732548..690265593b 100644 --- a/docs/apworld_dev_faq.md +++ b/docs/apworld_dev_faq.md @@ -52,7 +52,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 origin 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. -For performance reasons AP only checks every entrance once. However, if entrance access conditions depend on regions, then it is possible for this to happen: +For performance reasons, AP only checks every entrance once. 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 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.