day32--图的连通性检测

图的连通性可以使用Ma进行判断，Ma中第i行第 j 列元素为 0 的话, 就表示从节点i到节点 j不可达.Ma = M^0 + M^1 +M^2 +…+ M^n-1。
代码：

package com.three;

public class Graph {

    IntMatrix connectivityMatrix;// the connectivity matrix.

    /**
     * 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);
    }

    /**
     *********************
     * Overrides the method claimed in Object, the superclass of any class.
     *********************
     */
    public String toString() {
        String resultString = "This is the connectivity matrix of the graph.\r\n"
                + connectivityMatrix;
        return resultString;
    }// of toString

    /**
     * Get the connectvity of the graph.
     *
     * @throws Exception
     *              for internal error
     */
    public boolean getConnectivity() throws Exception {
        //Step 1. Initialize accumulated matrix : M_a = I.
        IntMatrix tempConnectivityMatrix = IntMatrix.getIdentityMatrix(connectivityMatrix.getData().length);

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

        //Step 3. 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(tempMultipliedMatrix,connectivityMatrix);
        }// of for i

        //Step 4. 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
     */
    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) {
            e.printStackTrace();
        }// of try

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

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

        tempConnected = false;
        try {
            tempConnected = tempGraph2.getConnectivity();
        } catch (Exception e) {
            e.printStackTrace();
        }// of try

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

    }// of getConnectivityTest

    public static void main(String[] args) {
        System.out.println("Hello world");
        Graph tempGraph = new Graph(3);
        System.out.println(tempGraph);

        //unit test
        getConnectivityTest();
    }// of main
}// of class Graph

运行结果：

Hello world
This is the connectivity matrix of the graph.
[[0, 0, 0], [0, 0, 0], [0, 0, 0]]
This is the connectivity matrix of the graph.
[[0, 1, 0], [1, 0, 1], [0, 1, 0]]
The connectivity matrix is: [[2, 1, 1], [1, 3, 1], [1, 1, 2]]
Is the graph connected? true
The connectivity matrix is: [[1, 1, 1], [0, 2, 1], [0, 1, 2]]
Node 1 cannot reach 0
Is the graph connected? false

重难点：利用公式计算判断图的连通性