  For finite reflection groups of types A and B, we determine the diameter of
the graph whose vertices are reduced words for the longest element and whose
edges are braid relations. This is deduced from a more general theorem that
applies to supersolvable hyperplane arrangements.
