All minimum spanning trees implementation?

Rubys gives a good general answer. But writing efficient code to generate all spanning trees of a graph is a beast of a challenge.

I don't know if this is the solution, but it's a solution (it's the graph version of a brute force, I would say).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.