Graph.java

package org.example.graph;

import java.util.*;

public class Graph {

    private Map<Node, List<Node>> adjacencyList = new HashMap<>();

    public int maxDepth = -1;
    public final List<Node> visited = new ArrayList<>();
    private Map<String, Integer> depths = new HashMap<>();

    public Map<Node, List<Node>> getAdjacencyList() {
        return adjacencyList;
    }

    public void setAdjacencyList(Map<Node, List<Node>> adjacencyList) {
        this.adjacencyList = adjacencyList;
    }

    public int getMaxDepth() {
        return maxDepth;
    }

    public void setMaxDepth(int maxDepth) {
        this.maxDepth = maxDepth;
    }

    public List<Node> getVisited() {
        return visited;
    }

    public Map<String, Integer> getDepths() {
        return depths;
    }

    public void setDepths(Map<String, Integer> depths) {
        this.depths = depths;
    }

    public void addNode(Node node) {
        adjacencyList.putIfAbsent(node, new ArrayList<>());
    }


    public void addEdge(Node node1, Node node2) {
        addNode(node1);
        addNode(node2);

        adjacencyList.get(node2).add(node1);
    }



    public double averageDepth() {
        return depths.values().stream().mapToInt(i -> i).average().orElse(0);
    }

    public int dfs(Node root, int count) {
        visited.add(root);

        for (Node node : adjacencyList.get(root)) {
            if (!visited.contains(node)) {
                int dfs = dfs(node, ++count);
                if (maxDepth < dfs) {
                    maxDepth = dfs;
                }

                depths.put(node.getClassName(), count);
                count--;
            }
        }

        return count;
    }
}