The leader list algorithm; it generates a list of basic blocks from
a directed graph. A basic block is a forward path of nodes that requires
neither branching from nor into.
Minimal graph signature for leader list algorithm
leader_lists graph root computes the leader lists or basic blocks
of the given graph. The node root is always a leader of a basic block.
leader_lists graph root