遍历每个图节点并比较java

import java.util.*;

class Node {
    int value;
    List<Node> neighbors;

    public Node(int value) {
        this.value = value;
        this.neighbors = new ArrayList<>();
    }
}

public class GraphTraversal {
    public static void main(String[] args) {
        // 构建图
        Node node1 = new Node(1);
        Node node2 = new Node(2);
        Node node3 = new Node(3);
        Node node4 = new Node(4);

        node1.neighbors.add(node2);
        node1.neighbors.add(node3);
        node2.neighbors.add(node4);

        // 遍历图节点并比较
        Set<Node> visited = new HashSet<>();
        compareNodes(node1, visited);
    }

    public static void compareNodes(Node node, Set<Node> visited) {
        // 比较操作，这里假设比较节点的值是否大于等于3
        if (node.value >= 3) {
            System.out.println("Node " + node.value + " satisfies the condition.");
        }

        visited.add(node);

        for (Node neighbor : node.neighbors) {
            if (!visited.contains(neighbor)) {
                compareNodes(neighbor, visited);
            }
        }
    }
}