在java中对图的邻接矩阵进行编码并计算三角形数

public class Graph {
    private int[][] adjacencyMatrix;
    private int numVertices;

    public Graph(int numVertices) {
        this.numVertices = numVertices;
        adjacencyMatrix = new int[numVertices][numVertices];
    }

    public void addEdge(int source, int destination) {
        adjacencyMatrix[source][destination] = 1;
        adjacencyMatrix[destination][source] = 1;
    }

    public int countTriangles() {
        int count = 0;
        for (int i = 0; i < numVertices; i++) {
            for (int j = 0; j < numVertices; j++) {
                for (int k = 0; k < numVertices; k++) {
                    if (adjacencyMatrix[i][j] == 1 && adjacencyMatrix[j][k] == 1 && adjacencyMatrix[k][i] == 1) {
                        count++;
                    }
                }
            }
        }
        return count / 6; // 由于每个三角形被计算了6次，所以需要除以6得到实际的三角形数
    }

    public static void main(String[] args) {
        Graph graph = new Graph(4);
        graph.addEdge(0, 1);
        graph.addEdge(1, 2);
        graph.addEdge(2, 0);
        graph.addEdge(0, 3);
        graph.addEdge(3, 2);

        int triangleCount = graph.countTriangles();
        System.out.println("Number of triangles in the graph: " + triangleCount);
    }
}