Tool created by Ryan Belaib, Adrien Jayat, Lucas Levy, Clément Desberg and Nathan Wurpillot as part of the Bioinformatics course by Christian Michel.
A circular code is a set of words (or sequences) such that the circular concatenation of two distinct words never creates ambiguity. In other words, reading a word in a loop always allows you to find the starting point of that word without confusing it with another word from the code.
We model this behavior using the graph obtained through the course method (see Christian Michel's Bioinformatics course), and if it contains no cycles, then the code is circular. Stronger properties like being comma-free can be deduced from the length of the longest path in the graph. A code is comma-free if this length is at most 2, and strong comma-free if it is 1.