neighborhoodWalking

Group cases into neighborhoods based on walking distance.

Amends errors, augments data and aids analysis of John Snow's map
of the 1854 London cholera outbreak.

Peter Li 

cholera

Amend, Augment and Aid Analysis of John Snow's Cholera Map

neighborhoodWalking function

<dl><dt>pump.select</dt>
<dd>Numeric. Vector of numeric pump IDs to define pump neighborhoods (i.e., the "population"). Negative selection possible. <code>NULL</code> selects all pumps. Note that you can't just select the pump on Adam and Eve Court (#2) because it's technically an isolate.</dd>
<dt>vestry</dt>
<dd>Logical. <code>TRUE</code> uses the 14 pumps from the Vestry report. <code>FALSE</code> uses the 13 in the original map.</dd>
<dt>weighted</dt>
<dd>Logical. <code>TRUE</code> computes shortest path weighted by road length. <code>FALSE</code> computes shortest path in terms of the number of nodes.</dd>
<dt>case.set</dt>
<dd>Character. "observed" or "expected".</dd>
<dt>latlong</dt>
<dd>Logical.</dd>
<dt>multi.core</dt>
<dd>Logical or Numeric. <code>TRUE</code> uses <code><a href="/link/parallel%3A%3AdetectCores()?package=cholera&version=0.9.1" data-mini-rdoc="cholera::parallel::detectCores()">parallel::detectCores()</a></code>. <code>FALSE</code> uses one, single core. You can also specify the number logical cores. See <code>vignette("Parallelization")</code> for details.</dd></dl>

Arguments

Compute walking path pump neighborhoods. — neighborhoodWalking

<dl>

<dt>pump.select</dt>
<dd>Numeric. Vector of numeric pump IDs to define pump neighborhoods (i.e., the "population"). Negative selection possible. <code>NULL</code> selects all pumps. Note that you can't just select the pump on Adam and Eve Court (#2) because it's technically an isolate.</dd>


<dt>vestry</dt>
<dd>Logical. <code>TRUE</code> uses the 14 pumps from the Vestry report. <code>FALSE</code> uses the 13 in the original map.</dd>


<dt>weighted</dt>
<dd>Logical. <code>TRUE</code> computes shortest path weighted by road length. <code>FALSE</code> computes shortest path in terms of the number of nodes.</dd>


<dt>case.set</dt>
<dd>Character. "observed" or "expected".</dd>


<dt>latlong</dt>
<dd>Logical.</dd>


<dt>multi.core</dt>
<dd>Logical or Numeric. <code>TRUE</code> uses <code><a href='https://rdrr.io/r/parallel/detectCores.html'>parallel::detectCores()</a></code>. <code>FALSE</code> uses one, single core. You can also specify the number logical cores. See <code>vignette("Parallelization")</code> for details.</dd>

</dl>

neighborhoodWalking: Compute walking path pump neighborhoods.

Description

Usage

Arguments