This function creates a breakpoint graph given an extended permutation.
References
Hannenhalli, Sridhar, and Pavel A. Pevzner. "Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals." Journal of the ACM (JACM) 46.1 (1999): 1-27.
See also
Other Breakpoint graph functions:
bp_count(),
breakpointGraphProperties(),
components_graph(),
cycle_count(),
extendedPermutation(),
hurdles_count(),
is_fortress(),
is_interleaving(),
superhurdles_count()