Summary

In CircularDependencyRspackPlugin, we should check all cycle, for example, if we have follow case:

// a.js
import './b.js';

// b.js
import './c.js';

// c.js
import './d.js';
import './e.js';

// d.js
import './a.js';

// e.js
import './a.js';

In that case, we shoud output two cycle check diagnostic messages:

a.js -> b.js -> c.js -> d.js -> a.js

a.js -> b.js -> c.js -> e.js -> a.js

In the algorithm of CircularDependencyRspackPlugin's fn recurse_dependencies() we just use a visited(seen_set) hashmap to filter the duplicate module id, like c.js will be recurse twice, so it will not be outputed twice, the output now will be:

a.js -> b.js -> c.js -> d.js -> a.js

The behavior is not right as the user's feedback, so we need to move the visited hashmap here in the algorithm, just use the simple algorithm here like the answer of https://leetcode.cn/problems/binary-tree-paths/description/.

closes: #9889

Checklist

• Tests updated (or not required).
• Documentation updated (or not required).