This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
I am looking for a way to run a minimum-distance spanning tree algorithm in Alteryx. I would start with an input table listing all edges with 3 columns: [vertex 1], [vertex 2], [strength] (or distance or cost...). The goal would be to obtain the output table with the same format corresponding to the pruned optimal spanning tree (minimizing or maximizing the strength). I would then send it to the "Network Analysis Tool" to obtain a pretty force-graph.
Actually... I just did. I was reluctant to try and it was not a piece of cake as this is a first time for me and I know so little about R. But I could find a piece of code doing just MST on CRAN (https://rdrr.io/cran/edmcr/src/R/mst.R). After a few... no actually a long (!) range of trials and errors I could squeeze it into the R Tool in Alteryx.
It works! 😁😁👍
I had been so hard about how to get this done within Alteryx...
Following discussion with @Gottfried on the french community here is an update to the macro. The idea is to add an output with the Vertex list to facilitate integration with the Network analysis tool. Indeed, it really makes sense to combine them together.
@Gottfried, just to help other members of the english community to easily find topics about prism, as you have already done it on the French community, thank you to accept this post as a solution if you think it is relevant.