/**
 * File: graph_dfs.js
 * Created Time: 2023-02-21
 * Author: Zhuo Qinyue (1403450829@qq.com)
 */

const { Vertex } = require('../modules/Vertex');
const { GraphAdjList } = require('./graph_adjacency_list');

/* Depth-first traversal */
// Represent the graph with an adjacency list to access all neighbors of a given vertex
function dfs(graph, visited, res, vet) {
    res.push(vet); // Record the visited vertex
    visited.add(vet); // Mark this vertex as visited
    // Traverse all neighbors of this vertex
    for (const adjVet of graph.adjList.get(vet)) {
        if (visited.has(adjVet)) {
            continue; // Skip vertices that have already been visited
        }
        // Recursively visit the neighboring vertex
        dfs(graph, visited, res, adjVet);
    }
}

/* Depth-first traversal */
// Represent the graph with an adjacency list to access all neighbors of a given vertex
function graphDFS(graph, startVet) {
    // Vertex traversal sequence
    const res = [];
    // Hash set recording visited vertices
    const visited = new Set();
    dfs(graph, visited, res, startVet);
    return res;
}

/* Driver code */
/* Initialize the undirected graph */
const v = Vertex.valsToVets([0, 1, 2, 3, 4, 5, 6]);
const edges = [
    [v[0], v[1]],
    [v[0], v[3]],
    [v[1], v[2]],
    [v[2], v[5]],
    [v[4], v[5]],
    [v[5], v[6]],
];
const graph = new GraphAdjList(edges);
console.log('\nGraph after initialization:');
graph.print();

/* Depth-first traversal */
const res = graphDFS(graph, v[0]);
console.log('\nVertex sequence from depth-first traversal (DFS):');
console.log(Vertex.vetsToVals(res));