public static void dfs1(UndirectedGraphNode node){
        if(node == null) return;

        System.out.print(node.label + " ");
        node.visited = true;

        for(UndirectedGraphNode neighbor : node.neighbors){
            if(neighbor.visited == false){
                neighbor.visited = true;
                dfs1(neighbor);
            }
        }
    }