Skip to content

Commit

Permalink
Merge pull request #117 from jGaboardi/refresh_docs
Browse files Browse the repository at this point in the history
refreshing docs
  • Loading branch information
jGaboardi committed Sep 17, 2018
2 parents 7eb73fe + 1f406f0 commit 5108dcd
Show file tree
Hide file tree
Showing 7 changed files with 145 additions and 97 deletions.
Binary file modified doc/_build/doctrees/environment.pickle
Binary file not shown.
Binary file not shown.
Binary file not shown.
185 changes: 101 additions & 84 deletions doc/_build/html/_modules/spaghetti/network.html

Large diffs are not rendered by default.

Original file line number Diff line number Diff line change
Expand Up @@ -134,11 +134,13 @@ <h1>spaghetti.Network.allneighbordistances<a class="headerlink" href="#spaghetti
<col class="field-body" />
<tbody valign="top">
<tr class="field-odd field"><th class="field-name">Parameters:</th><td class="field-body"><dl class="first docutils">
<dt><strong>sourcepattern</strong> <span class="classifier-delimiter">:</span> <span class="classifier">str</span></dt>
<dd><p class="first last">The key of a point pattern snapped to the network.</p>
<dt><strong>sourcepattern</strong> <span class="classifier-delimiter">:</span> <span class="classifier">str or spaghetti.network.PointPattern</span></dt>
<dd><p class="first last">The key of a point pattern snapped to the network OR
the full spaghetti.network.PointPattern object.</p>
</dd>
<dt><strong>destpattern</strong> <span class="classifier-delimiter">:</span> <span class="classifier">str</span></dt>
<dd><p class="first last">(Optional) The key of a point pattern snapped to the network.</p>
<dd><p class="first last">(Optional) The key of a point pattern snapped to the network OR
the full spaghetti.network.PointPattern object.</p>
</dd>
<dt><strong>fill_diagonal</strong> <span class="classifier-delimiter">:</span> <span class="classifier">float, int</span></dt>
<dd><p class="first last">(Optional) Fill the diagonal of the cost matrix. Default in None
Expand All @@ -160,6 +162,9 @@ <h1>spaghetti.Network.allneighbordistances<a class="headerlink" href="#spaghetti
<dt><strong>nearest</strong> <span class="classifier-delimiter">:</span> <span class="classifier">numpy.ndarray</span></dt>
<dd><p class="first last">An array of shape (n,n) storing distances between all points.</p>
</dd>
<dt><strong>tree_nearest</strong> <span class="classifier-delimiter">:</span> <span class="classifier">dict</span></dt>
<dd><p class="first last">nearest network node to point pattern node shortest path lookup</p>
</dd>
</dl>
</td>
</tr>
Expand All @@ -171,26 +176,30 @@ <h1>spaghetti.Network.allneighbordistances<a class="headerlink" href="#spaghetti
<span class="gp">&gt;&gt;&gt; </span><span class="n">ntw</span><span class="o">.</span><span class="n">snapobservations</span><span class="p">(</span><span class="n">examples</span><span class="o">.</span><span class="n">get_path</span><span class="p">(</span><span class="s1">&#39;crimes.shp&#39;</span><span class="p">),</span>
<span class="gp">... </span> <span class="s1">&#39;crimes&#39;</span><span class="p">,</span>
<span class="gp">... </span> <span class="n">attribute</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">crimes_pp</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">pointpatterns</span><span class="p">[</span><span class="s1">&#39;crimes&#39;</span><span class="p">]</span>
</pre></div>
</div>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">s2s_dist</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">allneighbordistances</span><span class="p">(</span><span class="n">crimes_pp</span><span class="p">)</span>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">s2s_dist</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">allneighbordistances</span><span class="p">(</span><span class="s1">&#39;crimes&#39;</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">s2s_dist</span><span class="p">[</span><span class="mi">0</span><span class="p">,</span><span class="mi">0</span><span class="p">],</span> <span class="n">s2s_dist</span><span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">0</span><span class="p">]</span>
<span class="go">(nan, 3105.189475447081)</span>
</pre></div>
</div>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">ntw</span><span class="o">.</span><span class="n">snapobservations</span><span class="p">(</span><span class="n">examples</span><span class="o">.</span><span class="n">get_path</span><span class="p">(</span><span class="s1">&#39;schools.shp&#39;</span><span class="p">),</span>
<span class="gp">... </span> <span class="s1">&#39;schools&#39;</span><span class="p">,</span>
<span class="gp">... </span> <span class="n">attribute</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">schools_pp</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">pointpatterns</span><span class="p">[</span><span class="s1">&#39;schools&#39;</span><span class="p">]</span>
</pre></div>
</div>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">s2d_dist</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">allneighbordistances</span><span class="p">(</span><span class="n">crimes_pp</span><span class="p">,</span>
<span class="gp">... </span> <span class="n">destpattern</span><span class="o">=</span><span class="n">schools_pp</span><span class="p">)</span>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">s2d_dist</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">allneighbordistances</span><span class="p">(</span><span class="s1">&#39;crimes&#39;</span><span class="p">,</span>
<span class="gp">... </span> <span class="n">destpattern</span><span class="o">=</span><span class="s1">&#39;schools&#39;</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">s2d_dist</span><span class="p">[</span><span class="mi">0</span><span class="p">,</span><span class="mi">0</span><span class="p">],</span> <span class="n">s2d_dist</span><span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">0</span><span class="p">]</span>
<span class="go">(4520.72353741989, 6340.422971967316)</span>
</pre></div>
</div>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">s2d_dist</span><span class="p">,</span> <span class="n">tree</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">allneighbordistances</span><span class="p">(</span><span class="s1">&#39;schools&#39;</span><span class="p">,</span>
<span class="gp">... </span> <span class="n">gen_tree</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">tree</span><span class="p">[(</span><span class="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">)]</span>
<span class="go">(173, 64)</span>
</pre></div>
</div>
</dd></dl>

</div>
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -125,7 +125,7 @@
<h1>spaghetti.Network.nearestneighbordistances<a class="headerlink" href="#spaghetti-network-nearestneighbordistances" title="Permalink to this headline"></a></h1>
<dl class="method">
<dt id="spaghetti.Network.nearestneighbordistances">
<code class="descclassname">Network.</code><code class="descname">nearestneighbordistances</code><span class="sig-paren">(</span><em>sourcepattern</em>, <em>destpattern=None</em>, <em>n_processes=None</em>, <em>gen_tree=False</em><span class="sig-paren">)</span><a class="reference internal" href="../_modules/spaghetti/network.html#Network.nearestneighbordistances"><span class="viewcode-link">[source]</span></a><a class="headerlink" href="#spaghetti.Network.nearestneighbordistances" title="Permalink to this definition"></a></dt>
<code class="descclassname">Network.</code><code class="descname">nearestneighbordistances</code><span class="sig-paren">(</span><em>sourcepattern</em>, <em>destpattern=None</em>, <em>n_processes=None</em>, <em>gen_tree=False</em>, <em>all_dists=None</em>, <em>keep_zero_dist=True</em><span class="sig-paren">)</span><a class="reference internal" href="../_modules/spaghetti/network.html#Network.nearestneighbordistances"><span class="viewcode-link">[source]</span></a><a class="headerlink" href="#spaghetti.Network.nearestneighbordistances" title="Permalink to this definition"></a></dt>
<dd><p>Compute the interpattern nearest neighbor distances or the
intrapattern nearest neighbor distances between a source
pattern and a destination pattern.</p>
Expand All @@ -148,19 +148,41 @@ <h1>spaghetti.Network.nearestneighbordistances<a class="headerlink" href="#spagh
<dt><strong>gen_tree</strong> <span class="classifier-delimiter">:</span> <span class="classifier">bool</span></dt>
<dd><p class="first last">rebuild shortest path {True}, or skip {False}</p>
</dd>
<dt><strong>all_dists</strong> <span class="classifier-delimiter">:</span> <span class="classifier">numpy.ndarray</span></dt>
<dd><p class="first last">An array of shape (n,n) storing distances between all points.</p>
</dd>
<dt><strong>keep_zero_dist</strong> <span class="classifier-delimiter">:</span> <span class="classifier">bool</span></dt>
<dd><p class="first last">Include zero values in minimum distance (True) or exclude (False).
Default is True. If the source pattern is the same as the
destination pattern the diagonal is filled with nans</p>
</dd>
</dl>
</td>
</tr>
<tr class="field-even field"><th class="field-name">Returns:</th><td class="field-body"><dl class="first last docutils">
<dt><strong>nearest</strong> <span class="classifier-delimiter">:</span> <span class="classifier">numpy.ndarray</span></dt>
<dd><p class="first last">An (n,2) shaped array with column[:,0] containing the id of the
nearest neighbor and column [:,1] containing the distance.</p>
<dt><strong>nearest</strong> <span class="classifier-delimiter">:</span> <span class="classifier">dict</span></dt>
<dd><p class="first last">key is source point id, value is tuple of list containing
nearest destination point ids and distance.</p>
</dd>
</dl>
</td>
</tr>
</tbody>
</table>
<p class="rubric">Examples</p>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="kn">import</span> <span class="nn">spaghetti</span> <span class="k">as</span> <span class="nn">spgh</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">ntw</span> <span class="o">=</span> <span class="n">spgh</span><span class="o">.</span><span class="n">Network</span><span class="p">(</span><span class="n">examples</span><span class="o">.</span><span class="n">get_path</span><span class="p">(</span><span class="s1">&#39;streets.shp&#39;</span><span class="p">))</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">ntw</span><span class="o">.</span><span class="n">snapobservations</span><span class="p">(</span><span class="n">examples</span><span class="o">.</span><span class="n">get_path</span><span class="p">(</span><span class="s1">&#39;crimes.shp&#39;</span><span class="p">),</span> <span class="s1">&#39;crimes&#39;</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">nn</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">nearestneighbordistances</span><span class="p">(</span><span class="s1">&#39;crimes&#39;</span><span class="p">,</span> <span class="n">keep_zero_dist</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">nn</span><span class="p">[</span><span class="mi">11</span><span class="p">],</span> <span class="n">nn</span><span class="p">[</span><span class="mi">18</span><span class="p">]</span>
<span class="go">(([18, 19], 165.33982412719126), ([19], 0.0))</span>
</pre></div>
</div>
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">&gt;&gt;&gt; </span><span class="n">nn</span> <span class="o">=</span> <span class="n">ntw</span><span class="o">.</span><span class="n">nearestneighbordistances</span><span class="p">(</span><span class="s1">&#39;crimes&#39;</span><span class="p">,</span> <span class="n">keep_zero_dist</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
<span class="gp">&gt;&gt;&gt; </span><span class="n">nn</span><span class="p">[</span><span class="mi">11</span><span class="p">],</span> <span class="n">nn</span><span class="p">[</span><span class="mi">18</span><span class="p">]</span>
<span class="go">(([18, 19], 165.33982412719126), ([11], 165.33982412719126))</span>
</pre></div>
</div>
</dd></dl>

</div>
Expand Down
2 changes: 1 addition & 1 deletion doc/_build/html/searchindex.js

Large diffs are not rendered by default.

0 comments on commit 5108dcd

Please sign in to comment.