  We describe a new method for computing the graph of commutation classes of
double wiring diagrams. Using these methods we compute the graph for five
strings or less which allows us to confirm a positivity conjecture of Fomin and
Zelevinsky when n is less than five .
