which minimum spanning tree algorithm?

[DavidMedeiros]

I have a student who is using 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.

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?

How the Cost Connectivity tool works—Help | ArcGIS Desktop 

Minimum spanning tree - Wikipedia 

[TimothyHales]

The https://community.esri.com/community/events/fedgis?sr=search&searchId=9d32edec-af5e-4c1b-b223-ba6396...‌ and the DC DevSummit is this week, so that may be the reason for the delay in response. I will follow up with them.

[KevinJohnston1]

Esri’s Cost Connectivity tool currently determines the minimum spanning tree output based upon Kruskal’s algorithm.

Kruskal, J. B. (1956). "On the shortest spanning subtree of a graph and the traveling salesman problem". Proceedings of the American Mathematical Society. 7: 48–50. doi:10.1090/S0002-9939-1956-0078686-7. 

Kevin J

Esri Development

[DanPatterson_Retired]

Thanks Kevin...

good to know ..... now for the next question

...what is the difference between them

Kruskal vs Prim's specifically their references within