<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: which minimum spanning tree algorithm? in Geoprocessing Questions</title>
    <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613426#M20362</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I would venture that given the same point and constraints, they 'should' all return the same tree. &amp;nbsp;Most differentiation is based on the spped at which a solution is determined. &amp;nbsp;In&amp;nbsp; &lt;A href="http://www.arcgis.com/home/item.html?id=6ce9db93533345e49350d30a07fc913a"&gt;Spanning Tree Tools&lt;/A&gt;&amp;nbsp;I am pretty sure I use Prim's algorithm since it was easy to implement. &amp;nbsp;Are you comparing the difference between derivations of the spanning trees? the speed? the complexity that one can ascribe to the analysis? &amp;nbsp;Perhaps you could elaborate?&lt;/P&gt;&lt;P&gt;&lt;A href="https://community.esri.com/people/timothy_hales-esristaff"&gt;timothy_hales-esristaff&lt;/A&gt;‌ is there someone on dev team that could answer this?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Mon, 23 Jan 2017 21:32:40 GMT</pubDate>
    <dc:creator>DanPatterson_Retired</dc:creator>
    <dc:date>2017-01-23T21:32:40Z</dc:date>
    <item>
      <title>which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613425#M20361</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I have a student who is using&amp;nbsp;the Cost Connectivity tools in ArcGIS for his research who needs to know the specific algorithm being used in the tool to determine the minimum spanning tree.&lt;/P&gt;&lt;P&gt;The ArcGIS online help only refers to the linked wikipedia article for more detail on the method, but there are several algorithms listed there. How can he determine the specific one being used in the arcGIS tool?&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A class="link-titled" href="http://pro.arcgis.com/en/pro-app/tool-reference/spatial-analyst/how-cost-connectivity-works.htm" title="http://pro.arcgis.com/en/pro-app/tool-reference/spatial-analyst/how-cost-connectivity-works.htm"&gt;How the Cost Connectivity tool works—Help | ArcGIS Desktop&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;A class="link-titled" href="https://en.wikipedia.org/wiki/Minimum_spanning_tree" title="https://en.wikipedia.org/wiki/Minimum_spanning_tree"&gt;Minimum spanning tree - Wikipedia&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Mon, 23 Jan 2017 21:17:51 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613425#M20361</guid>
      <dc:creator>DavidMedeiros</dc:creator>
      <dc:date>2017-01-23T21:17:51Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613426#M20362</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I would venture that given the same point and constraints, they 'should' all return the same tree. &amp;nbsp;Most differentiation is based on the spped at which a solution is determined. &amp;nbsp;In&amp;nbsp; &lt;A href="http://www.arcgis.com/home/item.html?id=6ce9db93533345e49350d30a07fc913a"&gt;Spanning Tree Tools&lt;/A&gt;&amp;nbsp;I am pretty sure I use Prim's algorithm since it was easy to implement. &amp;nbsp;Are you comparing the difference between derivations of the spanning trees? the speed? the complexity that one can ascribe to the analysis? &amp;nbsp;Perhaps you could elaborate?&lt;/P&gt;&lt;P&gt;&lt;A href="https://community.esri.com/people/timothy_hales-esristaff"&gt;timothy_hales-esristaff&lt;/A&gt;‌ is there someone on dev team that could answer this?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Mon, 23 Jan 2017 21:32:40 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613426#M20362</guid>
      <dc:creator>DanPatterson_Retired</dc:creator>
      <dc:date>2017-01-23T21:32:40Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613427#M20363</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Thanks. I'm not actually the researcher in question but am helping track this down for a PhD candidate who's a patron at my center. I don't think he's doing any comparative analysis between algorithms, rather he's compiling reference information for his works defense where he may&amp;nbsp;very likely be asked, "which min spanning tree algorithm did you use?". The answer can't be "I don't know" or "the one Esri uses" ; )&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Esri tools usually post the specific algorithm details on the help pages so I was surprised this wasn't there. Unless it really doesn't matter in practical terms which is used?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Mon, 23 Jan 2017 21:50:26 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613427#M20363</guid>
      <dc:creator>DavidMedeiros</dc:creator>
      <dc:date>2017-01-23T21:50:26Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613428#M20364</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hence my qualifications in my response, If someone on the geoprocessing team sees this or Timothy can flag someone, you may have a response. &amp;nbsp;I suspect the whole analysis isn't a simple variant given the aspects that are covered in the connectivity constraints. &amp;nbsp;The spanning tree, I suspect, is only one... and a minor one in the process.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Mon, 23 Jan 2017 22:25:00 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613428#M20364</guid>
      <dc:creator>DanPatterson_Retired</dc:creator>
      <dc:date>2017-01-23T22:25:00Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613429#M20365</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;We have reached out to the team that manages this gp tool, so they are aware of the question. Thanks!&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 24 Jan 2017 14:44:50 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613429#M20365</guid>
      <dc:creator>TimothyHales</dc:creator>
      <dc:date>2017-01-24T14:44:50Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613430#M20366</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Thanks guys!&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 24 Jan 2017 18:23:28 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613430#M20366</guid>
      <dc:creator>DavidMedeiros</dc:creator>
      <dc:date>2017-01-24T18:23:28Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613431#M20367</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi all, just checking in to see if there's a response from the GP team on this question? Thanks!&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;David&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 09 Feb 2017 18:11:08 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613431#M20367</guid>
      <dc:creator>DavidMedeiros</dc:creator>
      <dc:date>2017-02-09T18:11:08Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613432#M20368</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;None to me... probably Prim's... Burkhardt at a pinch.&amp;nbsp; You could simply pass the buck and indicate that it was not disclosed, since no references were given to the literature which might indicate otherwise, and that is what they usually do if there is some chance that an algorithm can affect outcomes&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 09 Feb 2017 18:37:54 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613432#M20368</guid>
      <dc:creator>DanPatterson_Retired</dc:creator>
      <dc:date>2017-02-09T18:37:54Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613433#M20369</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Thanks Dan. I was hoping Timothy would have been able to get the info direct form the GP dev team. I'll pass your suggestion on to the researcher.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 09 Feb 2017 18:49:02 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613433#M20369</guid>
      <dc:creator>DavidMedeiros</dc:creator>
      <dc:date>2017-02-09T18:49:02Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613434#M20370</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;No dice... &lt;A href="https://community.esri.com/people/timothy_hales-esristaff"&gt;timothy_hales-esristaff&lt;/A&gt;‌ indicated they are aware of the question, but I suspect Dev Summit has attentions turned in another direction.&amp;nbsp; Maybe someone there could put them on the spot &lt;IMG src="https://community.esri.com/legacyfs/online/emoticons/wink.png" /&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sun, 12 Feb 2017 18:44:04 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613434#M20370</guid>
      <dc:creator>DanPatterson_Retired</dc:creator>
      <dc:date>2017-02-12T18:44:04Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613435#M20371</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;The &lt;A href="https://community.esri.com/community/events/fedgis?sr=search&amp;amp;searchId=9d32edec-af5e-4c1b-b223-ba63963d0b6b&amp;amp;searchIndex=0"&gt;https://community.esri.com/community/events/fedgis?sr=search&amp;amp;searchId=9d32edec-af5e-4c1b-b223-ba63963d0b6b&amp;amp;searchIndex=0&lt;/A&gt;‌ and the DC DevSummit is this week, so that may be the reason for the delay in response. I will follow up with them.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sun, 12 Feb 2017 19:23:19 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613435#M20371</guid>
      <dc:creator>TimothyHales</dc:creator>
      <dc:date>2017-02-12T19:23:19Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613436#M20372</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P style="margin: 0in 0in 0pt;"&gt;Esri’s Cost Connectivity tool currently determines the minimum spanning tree output based upon Kruskal’s algorithm.&lt;/P&gt;&lt;P style="margin: 0in 0in 0pt;"&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;EM style="font-size: 11pt;"&gt;&lt;A href="https://en.wikipedia.org/wiki/Joseph_Kruskal"&gt;&lt;SPAN style="color: #0b0080; background: white; text-decoration: underline;"&gt;Kruskal, J. B.&lt;/SPAN&gt;&lt;/A&gt;&lt;SPAN style="color: #252525; background: white;"&gt;&amp;nbsp;&lt;/SPAN&gt;&lt;/EM&gt;&lt;SPAN style="background: white; color: #252525; font-size: 11pt;"&gt;(1956). "On the shortest spanning subtree of a graph and the traveling salesman problem".&lt;/SPAN&gt;&lt;SPAN&gt;&lt;EM style="color: #252525; background: white; font-size: 11pt;"&gt;&amp;nbsp;&lt;/EM&gt;&lt;/SPAN&gt;&lt;EM style="font-size: 11pt;"&gt;&lt;A href="https://en.wikipedia.org/wiki/Proceedings_of_the_American_Mathematical_Society"&gt;&lt;SPAN style="color: #0b0080; background: white; text-decoration: underline;"&gt;Proceedings of the American Mathematical Society&lt;/SPAN&gt;&lt;/A&gt;&lt;/EM&gt;&lt;SPAN style="background: white; color: #252525; font-size: 11pt;"&gt;.&lt;/SPAN&gt;&lt;SPAN&gt;&lt;EM style="color: #252525; background: white; font-size: 11pt;"&gt;&amp;nbsp;&lt;/EM&gt;&lt;/SPAN&gt;&lt;STRONG style="color: #252525; background: white; font-size: 11pt;"&gt;7&lt;/STRONG&gt;&lt;SPAN style="background: white; color: #252525; font-size: 11pt;"&gt;: 48–50.&lt;/SPAN&gt;&lt;SPAN&gt;&lt;EM style="color: #252525; background: white; font-size: 11pt;"&gt;&amp;nbsp;&lt;/EM&gt;&lt;/SPAN&gt;&lt;EM style="font-size: 11pt;"&gt;&lt;A href="https://en.wikipedia.org/wiki/Digital_object_identifier"&gt;&lt;SPAN style="color: #0b0080; background: white; text-decoration: underline;"&gt;doi&lt;/SPAN&gt;&lt;/A&gt;&lt;/EM&gt;&lt;SPAN style="background: white; color: #252525; font-size: 11pt;"&gt;:&lt;/SPAN&gt;&lt;EM style="font-size: 11pt;"&gt;&lt;A href="https://dx.doi.org/10.1090%2FS0002-9939-1956-0078686-7"&gt;&lt;SPAN style="color: #663366; background: white; text-decoration: underline;"&gt;10.1090/S0002-9939-1956-0078686-7&lt;/SPAN&gt;&lt;/A&gt;&lt;/EM&gt;&lt;SPAN style="background: white; color: #252525; font-size: 11pt;"&gt;.&lt;/SPAN&gt;&lt;SPAN&gt;&lt;EM style="color: #252525; background: white; font-size: 11pt;"&gt;&amp;nbsp;&lt;/EM&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;&lt;EM style="color: #252525; background: white; font-size: 11pt;"&gt;Kevin J&lt;/EM&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN&gt;&lt;EM style="color: #252525; background: white; font-size: 11pt;"&gt;Esri Development&lt;/EM&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 14 Feb 2017 23:00:08 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613436#M20372</guid>
      <dc:creator>KevinJohnston1</dc:creator>
      <dc:date>2017-02-14T23:00:08Z</dc:date>
    </item>
    <item>
      <title>Re: which minimum spanning tree algorithm?</title>
      <link>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613437#M20373</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Thanks Kevin...&lt;/P&gt;&lt;P&gt;good to know ..... now for the next question&lt;/P&gt;&lt;P&gt;...what is the difference between them&lt;/P&gt;&lt;P&gt;&lt;A href="https://en.wikipedia.org/wiki/Kruskal's_algorithm"&gt;Kruskal&lt;/A&gt;&amp;nbsp;vs &lt;A href="https://en.wikipedia.org/wiki/Prim's_algorithm"&gt;Prim's&lt;/A&gt;&amp;nbsp;specifically their references within&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 14 Feb 2017 23:11:26 GMT</pubDate>
      <guid>https://community.esri.com/t5/geoprocessing-questions/which-minimum-spanning-tree-algorithm/m-p/613437#M20373</guid>
      <dc:creator>DanPatterson_Retired</dc:creator>
      <dc:date>2017-02-14T23:11:26Z</dc:date>
    </item>
  </channel>
</rss>

