Our call to the CQC algorithm in Table 1 is then CQC-Algorithm(flesh 3 n , fruit n ).
of the first two steps of the algorithm, a set of cycles and quasi-cycles for each sense of fruit n is collected, based on a DFS starting from the respective senses of our target word (we assume δ = 5).