Node.java

package test;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class Node {
    private String name;
    private List<Node> edges;
    private Message message;

    public Node(String name) {
        this.name = name;
        this.edges = new ArrayList<>();
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public List<Node> getEdges() {
        return edges;
    }

    public void setEdges(List<Node> edges) {
        this.edges = edges;
    }

    public Message getMessage() {
        return message;
    }

    public void setMessage(Message message) {
        this.message = message;
    }

    public void addEdge(Node node) {
        edges.add(node);
    }

    public boolean hasCycles() {
        return hasCycles(this, new HashSet<>());
    }

    private boolean hasCycles(Node target, Set<Node> visited) {
        if (visited.contains(this)) {
            return false;
        }
        visited.add(this);
        for (Node child : edges) {
            if (child == target) {
                return true;
            }
            if (child.hasCycles(target, visited)) {
                return true;
            }
        }
        return false;
    }
}