stableTrees -- return the spanning trees that are stable

• Usage:

  stableTrees(th, Q)

• Inputs:
  • th, a list, of weights corresponding to each vertex
  • Q, a toric quiver,
• Outputs:
  • L, a list, of lists, each representing the arrows that comprise a spanning tree that is stable with respect to the weight th

i1 : Q = bipartiteQuiver(2, 3);

i2 : th = {-3,-3,2,2,2};

i3 : stableTrees(th, Q)

o3 = {{0, 2, 4, 5}, {0, 1, 4, 5}, {1, 2, 3, 5}, {0, 1, 3, 5}, {1, 2, 3, 4},
     ------------------------------------------------------------------------
     {0, 2, 3, 4}}

o3 : List