day32

Day32

1. Background

今天是学习java的第32天了，今天练习的内容是图的连通性检测。

这个我昨天本想花40分钟把它在熄灯之前做出来，今天看来是我想多了。

我今天大概下午六点就回寝室了，研究代码研究到了现在。即使现在我把代码过了一遍，还是感觉非常艰难。

2. Description

所谓图的连通性，就是看任意两点有没有路径。

对于有向图，则是要任意两点互相有路径。

3. Code

package datastructure.graph;

import matrix.IntMatrix;

public class Graph {
    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 given matrix.
     ***************
     */
    public Graph(int[][] paraMatrix) {
		connectivityMatrix = new IntMatrix(paraMatrix);
	}// Of the second constructor


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

    /**
     ***************
     * 获取图的联通性。
     * 
     * @throws Exception
     ***************
     */
    public boolean getConnectivity() throws Exception {
		// Step 1. 初始化矩阵，得到一个单位矩阵，这个单位矩阵的长和宽与目标连接矩阵一致.
		IntMatrix tempConnectivityMatrix = IntMatrix.getIdentityMatrix(connectivityMatrix.getData().length);

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

		// Step 3. 确定实际联通性。
		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 for getConnectivity.
	 *********************
	 */
	public static void getConnectivityTest() {
		// 测试一个无向图.
		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 ee) {
			System.out.println(ee);
		} // Of try.

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

		// 测试这个有向图.
		tempGraph2.connectivityMatrix.setValue(1, 0, 0);

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

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

	/**
	 *********************
	 * 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);
		
		getConnectivityTest();
	}// Of main
}

运行结果：