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	1048	August 30, 2020
Minimum Spanning Tree Problem - Constrained by total edge sum Optimization (Mathematical) jump	2	115	March 25, 2025
Retrieving shortest paths from Graphs.jl General Usage graphs	11	425	July 11, 2025
Graph algorithm for Lightgraph General Usage	15	726	February 6, 2021
Graph.jl : How to interpret the output information returned by the shortest path algorithms? Graphs question , package , lightgraphs , graphs	10	1237	February 17, 2023

Minimum Spanning Tree

Related topics