Merge pull request #355 from jGaboardi/citation_review

Citation review

docs/_modules/spaghetti/network.html

@@ -1046,7 +1046,7 @@ <h1>Source code for spaghetti.network</h1><div class="highlight"><pre>
 <span class="sd">        Notes</span>
 <span class="sd">        -----</span>
 <span class="sd">        </span>
-<span class="sd">        See cite:`AnselinRey2014` and cite:`rey_open_2015` for more details</span>
+<span class="sd">        See :cite:`AnselinRey2014` and :cite:`rey_open_2015` for more details</span>
 <span class="sd">        regarding spatial weights.</span>
 <span class="sd">        </span>
 <span class="sd">        Examples</span>

docs/_static/references.bib

@@ -166,10 +166,10 @@ @book{AhujaRavindraK
 publisher = {Prentice Hall},
 isbn = {013617549X},
 year = {1993},
-title = {Network flows : theory, algorithms, and applications},
+title = {{Network Flows: Theory, Algorithms, and Applications}},
 language = {eng},
 address = {Englewood Cliffs, N.J.},
-author = {Ahuja, Ravindra K.},
+author = {Ahuja, Ravindra K. and  Magnanti, Thomas L. and Orlin, James B.},
 keywords = {Network analysis (Planning); Mathematical optimization},
 lccn = {92026702},
 }

docs/generated/spaghetti.Network.html

@@ -165,7 +165,7 @@ <h1>spaghetti.Network<a class="headerlink" href="#spaghetti-network" title="Perm
 </dl>
 <p class="rubric">Notes</p>
 <p>See <a class="bibtex reference internal" href="../references.html#cliff1981" id="id1">[CH81]</a>, <a class="bibtex reference internal" href="../references.html#tansel1983a" id="id2">[TFL83]</a>,
-<a class="bibtex reference internal" href="../references.html#ahujaravindrak" id="id3">[Ahu93]</a>, <a class="bibtex reference internal" href="../references.html#labbe1995" id="id4">[LabbePT95]</a>,
+<a class="bibtex reference internal" href="../references.html#ahujaravindrak" id="id3">[AMO93]</a>, <a class="bibtex reference internal" href="../references.html#labbe1995" id="id4">[LabbePT95]</a>,
 <a class="bibtex reference internal" href="../references.html#kuby2009" id="id5">[KRUT09]</a>, <a class="bibtex reference internal" href="../references.html#barthelemy2011" id="id6">[Barthelemy11]</a>, 
 <a class="bibtex reference internal" href="../references.html#daskin2013" id="id7">[Das13]</a>, <a class="bibtex reference internal" href="../references.html#okabe2012" id="id8">[OS12d]</a>,
 <a class="bibtex reference internal" href="../references.html#ducruet2014" id="id9">[DB14]</a>, <a class="bibtex reference internal" href="../references.html#weber2016" id="id10">[Web16]</a>, for more in-depth discussion on
@@ -886,7 +886,7 @@ <h1>spaghetti.Network<a class="headerlink" href="#spaghetti-network" title="Perm
 </dd>
 </dl>
 <p class="rubric">Notes</p>
-<p>See cite:<cite>AnselinRey2014</cite> and cite:<cite>rey_open_2015</cite> for more details
+<p>See <a class="bibtex reference internal" href="../references.html#anselinrey2014" id="id23">[AR14]</a> and <a class="bibtex reference internal" href="../references.html#rey-open-2015" id="id24">[RAL+15]</a> for more details
 regarding spatial weights.</p>
 <p class="rubric">Examples</p>
 <p>Instantiate an instance of a network.</p>
@@ -994,7 +994,7 @@ <h1>spaghetti.Network<a class="headerlink" href="#spaghetti-network" title="Perm
 </dd>
 </dl>
 <p class="rubric">Notes</p>
-<p>Based on <a class="bibtex reference internal" href="../references.html#dijkstra1959a" id="id23">[Dij59]</a> and <a class="bibtex reference internal" href="../references.html#doi-10-1002-9781119967101-ch3" id="id24">[OS12a]</a>.</p>
+<p>Based on <a class="bibtex reference internal" href="../references.html#dijkstra1959a" id="id25">[Dij59]</a> and <a class="bibtex reference internal" href="../references.html#doi-10-1002-9781119967101-ch3" id="id26">[OS12a]</a>.</p>
 </dd></dl>
 
 <dl class="method">
@@ -1202,7 +1202,7 @@ <h1>spaghetti.Network<a class="headerlink" href="#spaghetti-network" title="Perm
 </dd>
 </dl>
 <p class="rubric">Notes</p>
-<p>See <a class="bibtex reference internal" href="../references.html#doi-10-1111-gean-12211" id="id25">[GFH19]</a> for a detailed discussion on
+<p>See <a class="bibtex reference internal" href="../references.html#doi-10-1111-gean-12211" id="id27">[GFH19]</a> for a detailed discussion on
 the modeling consequences of snapping points to spatial networks.</p>
 <p class="rubric">Examples</p>
 <p>Instantiate a network.</p>

docs/references.html

@@ -128,8 +128,11 @@
   <div class="section" id="references">
 <h1>References<a class="headerlink" href="#references" title="Permalink to this headline">¶</a></h1>
 <p id="bibtex-bibliography-references-0"><dl class="citation">
-<dt class="bibtex label" id="ahujaravindrak"><span class="brackets">Ahu93</span></dt>
-<dd><p>Ravindra K. Ahuja. <em>Network flows : theory, algorithms, and applications</em>. Prentice Hall, Englewood Cliffs, N.J., 1993. ISBN 013617549X.</p>
+<dt class="bibtex label" id="ahujaravindrak"><span class="brackets">AMO93</span></dt>
+<dd><p>Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. <em>Network Flows: Theory, Algorithms, and Applications</em>. Prentice Hall, Englewood Cliffs, N.J., 1993. ISBN 013617549X.</p>
+</dd>
+<dt class="bibtex label" id="anselinrey2014"><span class="brackets">AR14</span></dt>
+<dd><p>Luc Anselin and Sergio J. Rey. <em>Modern Spatial Econometrics in Practice: A Guide to GeoDa, GeoDaSpace and PySAL</em>. GeoDa Press, Chicago, 2014.</p>
 </dd>
 <dt class="bibtex label" id="barthelemy2011"><span class="brackets">Barthelemy11</span></dt>
 <dd><p>Marc Barthélemy. Spatial networks. <em>Physics Reports</em>, 499(1–3):1–101, 2011. <a class="reference external" href="https://doi.org/https://doi.org/10.1016/j.physrep.2010.11.002">doi:https://doi.org/10.1016/j.physrep.2010.11.002</a>.</p>
@@ -197,6 +200,9 @@ <h1>References<a class="headerlink" href="#references" title="Permalink to this
 <dt class="bibtex label" id="pysal2007"><span class="brackets">RA07</span></dt>
 <dd><p>Sergio J. Rey and Luc Anselin. PySAL: A Python Library of Spatial Analytical Methods. <em>The Review of Regional Studies</em>, 37(1):5–27, 2007. URL: <a class="reference external" href="https://rrs.scholasticahq.com/article/8285.pdf">https://rrs.scholasticahq.com/article/8285.pdf</a>.</p>
 </dd>
+<dt class="bibtex label" id="rey-open-2015"><span class="brackets">RAL+15</span></dt>
+<dd><p>Sergio J. Rey, Luc Anselin, Xun Li, Robert Pahle, Jason Laura, Wenwen Li, and Julia Koschinsky. Open Geospatial Analytics with PySAL. <em>ISPRS International Journal of Geo-Information</em>, 4(2):815–836, 2015. <a class="reference external" href="https://doi.org/doi:10.3390/ijgi4020815">doi:doi:10.3390/ijgi4020815</a>.</p>
+</dd>
 <dt class="bibtex label" id="tansel1983a"><span class="brackets">TFL83</span></dt>
 <dd><p>Barbaros C Tansel, Richard L Francis, and Timothy J Lowe. State of the Art—Location on Networks: A survey. Part I: The p-center and p-median Problems. <em>Management Science</em>, 29(4):482–497, 1983. <a class="reference external" href="https://doi.org/https://doi.org/10.1287/mnsc.29.4.482">doi:https://doi.org/10.1287/mnsc.29.4.482</a>.</p>
 </dd>

docsrc/_static/references.bib

@@ -166,10 +166,10 @@ @book{AhujaRavindraK
 publisher = {Prentice Hall},
 isbn = {013617549X},
 year = {1993},
-title = {Network flows : theory, algorithms, and applications},
+title = {{Network Flows: Theory, Algorithms, and Applications}},
 language = {eng},
 address = {Englewood Cliffs, N.J.},
-author = {Ahuja, Ravindra K.},
+author = {Ahuja, Ravindra K. and  Magnanti, Thomas L. and Orlin, James B.},
 keywords = {Network analysis (Planning); Mathematical optimization},
 lccn = {92026702},
 }

spaghetti/network.py

@@ -922,7 +922,7 @@ def distancebandweights(self, threshold, n_processes=1, gen_tree=False):
         Notes
         -----
         
-        See cite:`AnselinRey2014` and cite:`rey_open_2015` for more details
+        See :cite:`AnselinRey2014` and :cite:`rey_open_2015` for more details
         regarding spatial weights.
         
         Examples