日撸java_day32

第 32 天: 图的连通性检测

package datastructures.graph;

import matrix.IntMatrix;

/**
 * ClassName: Graph
 * Package: datastructures.graph
 * Description:  Directed graph. Note that undirected graphs are a special case of directed graphs.
 *
 * @Author: luv_x_c
 * @Create: 2023/5/23 10:36
 */
public class Graph {
    /**
     * The connected matrix.
     */
    IntMatrix connectivityMatrix;

    /**
     * The first constructor.
     *
     * @param paraNumNodes The number of nodes in the graph.
     */
    public Graph(int paraNumNodes) {
        connectivityMatrix = new IntMatrix(paraNumNodes, paraNumNodes);
    }// Of the first constructor

    /**
     * The second constructor.
     *
     * @param paraMatrix The data matrix.
     */
    public Graph(int[][] paraMatrix) {
        connectivityMatrix = new IntMatrix(paraMatrix);
    }// Of the second constructor

    @Override
    public String toString() {
        return "This is the connectivity matrix of the graph.\r\n" + connectivityMatrix;
    }// Of toString

    /**
     * Get the connectivity of the graph.
     *
     * @return Connective or not.
     * @throws Exception for internal error.
     */
    public boolean getConnectivity() throws Exception {
        // Step1. Initialize accumulated matrix: M_a = I.
        IntMatrix tempConnectivityMatrix = IntMatrix.getIdentityMatrix(connectivityMatrix.getData().length);

        // Step2. Initialize M^1.
        IntMatrix tempMultipliedMatrix = new IntMatrix(connectivityMatrix);

        // Step3. Determine the actual connectivity.
        for (int i = 0; i < connectivityMatrix.getData().length - 1; i++) {
            // M_a =M_a + M^k
            tempConnectivityMatrix.add(tempMultipliedMatrix);

            // M^k
            tempMultipliedMatrix = IntMatrix.multiply(connectivityMatrix, tempMultipliedMatrix);
        }// Of for i

        // Step4. Check the connectivity.
        System.out.println("The connectivity matrix is: " + tempConnectivityMatrix);
        int[][] tempData = tempConnectivityMatrix.getData();
        for (int i = 0; i < tempData.length; i++) {
            for (int j = 0; j < tempData.length; j++) {
                if (tempData[i][j] == 0) {
                    System.out.println("Node" + i + "cannot reach " + j);
                    return false;
                }// Of if
            }// Of for j
        }// Of for i

        return true;
    }// Of getConnectivity

    /**
     * Unit test for getConnectivity.
     */
    public static void getConnectivityTest() {
        // Test an undirected graph.
        int[][] tempMatrix = {{0, 1, 0}, {1, 0, 1}, {0, 1, 0}};
        Graph tempGraph2 = new Graph(tempMatrix);
        System.out.println(tempGraph2);

        boolean tempConnected = false;
        try {
            tempConnected = tempGraph2.getConnectivity();
        } catch (Exception e) {
            System.out.println(e);
        }// of try

        System.out.println("Is the graph connected? " + tempConnected);

        // Test a directed graph.
        // Remove one arc to from a directed graph.
        tempGraph2.connectivityMatrix.setValue(1, 0, 0);

        tempConnected = false;
        try {
            tempConnected = tempGraph2.getConnectivity();
        } catch (Exception e) {
            System.out.println(e);
        }// Of try.

        System.out.println("Is the graph connected? " + tempConnected);
    }// Of getConnectivity

    /**
     * The entrance of the program.
     *
     * @param args Not used now.
     */
    public static void main(String[] args) {
        Graph tempGraph = new Graph(3);
        System.out.println(tempGraph);

        // Unit test.
        getConnectivityTest();
    }// Of main

}// Of class Graph

其中有一点就是，图的矩阵表示法，矩阵的幂，表示通路的路径长度，学过线代应该蛮好理解..