“…Applying the smallest numbered node first rule, we select link (1,2) . After a DFS iteration the cycle 1-2-3-7-4-1 is obtained and added to C. Nodes in set {1,2,3,7,4} and links in set { (1,2), (2,3), (3,7), (7,4), (4,1)} are labeled as "covered".…”