26.萌时-查找依赖关系中的所有独立循环依赖

function findCycles(graph) {
    const cycles = [];
    const visited = new Set();
    const path = [];

    function visit(vertex) {
        visited.add(vertex);
        path.push(vertex);
        for (let neighbour of graph[vertex]) {
            if (!visited.has(neighbour)) {
                visit(neighbour);
            } else if (path.includes(neighbour)) {
                cycles.push(path.slice(path.indexOf(neighbour)));
            }
        }
        path.pop();
    }

    for (let vertex in graph) {
        if (!visited.has(vertex)) {
            visit(vertex);
        }
    }

    return cycles;
}

// Test the function
const graph = {
    'A': ['B'],
    'B': ['C'],
    'C': ['A', 'D'],
    'D': ['E'],
    'E': ['F'],
    'F': ['D']
};

console.log(findCycles(graph));