#include <sparseDigraph.h>
Inheritance diagram for cyclicButterfly:
Public Member Functions  
cyclicButterfly (TNode length, TNode base=2, goblinController &thisContext=goblinDefaultContext) throw () 
The cyclic (k,b) cyclic butterfly graph can be obtained from the (k,b) butterflyGraph by pairwise identification of the nodes in the two extreme layers.
Every graph node has b incoming and b outgoing arcs, and so the graph is Eulerian and 2bregular. The length of all directed cycles is a multiple of k and through every node, there is a unique directed cycle of length k.

