An N-input Banyan or Butterfly achieves complete
connectivity in log2 N rows.
The Banyan gets its name from a Banyan tree,
while the Butterfly gets its name from the fact that the crossovers look like
butterfly wings. A Banyan and Butterfly can be shown to be topologically equivalent.
