Hi everyone, I want the vectors combination of a minimum spanning tree. I don’t think that I was very clear, but its like the following example, I have this array, generated by the function kruskal_mst from the LightGraphs package: 12-element Array{Array{Int64,1},1}: [1, 2] [2, 3] [3, 4] […

Just off the top of my head (and if I’m understanding the problem correctly), what you want to do is create the subgraph with those array elements as edges, and then use something like dfs to pull out all the paths. That’s going to be very expensive, I think, and I don’t have a quick solution in cod…

Minimum Spanning Tree

General Usage

Domenico_Lahaye April 24, 2024, 4:35pm 10

Cool! Congrats.

1 Like

Topic		Replies	Views
LightGraphs: get all of the the shortest paths between 2 points? Graphs lightgraphs	1	1038	August 30, 2020
Graph algorithm for Lightgraph General Usage	15	703	February 6, 2021
Basic cycles in a un-directed gaph Specific Domains question	3	895	March 23, 2017
Graphs, k-centers and recursion Graphs graphs	6	843	June 10, 2018
Find k-cliques in a graph Specific Domains	15	4348	May 14, 2019

Minimum Spanning Tree

Related topics