Timeline for Is there a way to make FindSpanningTree return a directed graph?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 2, 2021 at 23:47 | comment | added | thorimur | @user3257842 oo, wasn't aware of this, yikes! it's a bit of a hack, but i suppose one could Rescale the edgeweights first—though I imagine @Szabolcs solution is computationally superior, given their description of what happens :) | |
| Aug 2, 2021 at 5:56 | vote | accept | user3257842 | ||
| Aug 2, 2021 at 12:25 | |||||
| Aug 2, 2021 at 5:43 | comment | added | user3257842 | I actually tried this beforehand but was getting inconsistent behavior. The easiest way to reproduce it is by: FindSpanningTree[ Graph[{1 \[DirectedEdge] 2, 2 \[DirectedEdge] 1, 2 \[DirectedEdge] 3, 3 \[DirectedEdge] 2, 1 \[DirectedEdge] 3, 3 \[DirectedEdge] 1}, EdgeWeight -> {-1, -1, -2, -2, -3, -3}]] Apparently FindSpanningTree does not like the combination of directed graphs and negative weights. | |
| Aug 2, 2021 at 5:05 | history | answered | thorimur | CC BY-SA 4.0 |