day34

Day 34 —— Depth First Traversal

1. Background

今天是学习java的第34天，今天学习的深度优先遍历。

2. Description

这个逻辑上与二叉树的深度优先遍历类似. 但要难一点。然后代码的写法上和昨天的很类似。

今天的代码实现用到了栈，用栈的后进先出特性，实现深度优先遍历。

https://www.cs.usfca.edu/~galles/visualization/DFS.html

具体的运行逻辑可以看上面的这个网站。

3. Code

package datastructure.graph;

import matrix.IntMatrix;
import datastructure.CircleObjectQueue;
import datastructure.ObjectStack;

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

	public String breadthFirstTraversal(int paraStartIndex) {
		CircleObjectQueue tempQueue = new CircleObjectQueue();
		String resultString = "";
		
		int tempNumNodes = connectivityMatrix.getRows();
		boolean[] tempVisitedArray = new boolean[tempNumNodes];
		
		// 深度优先遍历的开头，即对起始节点(paraStartIndex)进行处理。
		tempVisitedArray[paraStartIndex] = true;
		resultString += paraStartIndex;
		Integer tempIndexInteger = Integer.valueOf(paraStartIndex);
		tempQueue.enQueue(tempIndexInteger); // 入队起始节点.
		
		// 访问表的剩余部分。
		int tempIndex;
		Integer tempInteger = (Integer)tempQueue.deQueue();// 出队队首节点。
		while (tempInteger != null) {
			tempIndex = tempInteger.intValue();
					
			// 访问当前出队节点的所有邻居。
			for (int i = 0; i < tempNumNodes; i ++) {
				if (tempVisitedArray[i]) {
					continue; // Already visited.
				}//Of if
				
				if (connectivityMatrix.getData()[tempIndex][i] == 0) {
					continue; // 没有和当前出队节点链接.
				}//Of if
				
				// 经过上面的筛选，执行下面代码的节点均符合要求。
				tempVisitedArray[i] = true;
				resultString += i;
				Integer tempInteger2 = Integer.valueOf(i);
				tempQueue.enQueue(tempInteger2);
			}//Of for i
			
			// Take out one from the head.
			tempInteger = (Integer)tempQueue.deQueue();
		}//Of while
		
		return resultString;
	}//Of breadthFirstTraversal
	
	/**
	 *********************
	 * Unit test for breadthFirstTraversal.
	 *********************
	 */
	public static void breadthFirstTraversalTest() {
		// Test an undirected graph.
		int[][] tempMatrix = { { 0, 1, 1, 0 }, { 1, 0, 0, 1 }, { 1, 0, 0, 1}, { 0, 1, 1, 0} };
		Graph tempGraph = new Graph(tempMatrix);
		System.out.println(tempGraph);

		String tempSequence = "";
		try {
			tempSequence = tempGraph.breadthFirstTraversal(2);
		} catch (Exception ee) {
			System.out.println(ee);
		} // Of try.

		System.out.println("The breadth first order of visit: " + tempSequence);
	}//Of breadthFirstTraversalTest

	/**
	 *********************
	 * Depth first traversal.
	 * 
	 * @param paraStartIndex The start index.
	 * @return The sequence of the visit.
	 *********************
	 */
	public String depthFirstTraversal(int paraStartIndex) {
		ObjectStack tempStack = new ObjectStack();
		String resultString = "";
		
		int tempNumNodes = connectivityMatrix.getRows();
		boolean[] tempVisitedArray = new boolean[tempNumNodes];
		
		// 初始化栈，并对给定的初始点进行处理，让它进栈。
		tempVisitedArray[paraStartIndex] = true;
		resultString += paraStartIndex;
		Integer tempIntegerIndex = Integer.valueOf(paraStartIndex);
		tempStack.Push(tempIntegerIndex);
		System.out.println("Push " + paraStartIndex);
		System.out.println("Visited " + resultString);
		
		// 深度优先遍历的主体，对当前栈顶元素的下家进行入栈操作。
		int tempIndex = paraStartIndex;
		int tempNext;
		Integer tempInteger;
		while (true){
		// 不断的向下挖下家。
			tempNext = -1;
			for (int i = 0; i < tempNumNodes; i ++) {
				if (tempVisitedArray[i]) {
					continue; //Already visited.
				}//Of if
				
				if (connectivityMatrix.getData()[tempIndex][i] == 0) {
					continue; //Not directly connected.
				}//Of if
				
				// Visit this one.
				tempVisitedArray[i] = true;
				resultString += i;
				Integer tempInteger2 = Integer.valueOf(i);
				tempStack.Push(tempInteger2);
				System.out.println("Push " + i);
				tempNext = i;
				
				//One is enough.
				break;
			}//Of for i
			
			
			if (tempNext == -1) {
				if (tempStack.isEmpty()) {
					break;
				}//Of if
				tempInteger = (Integer)tempStack.Pop();
				System.out.println("Pop " + tempInteger);
				tempIndex = tempInteger.intValue();
			} else {
				tempIndex = tempNext;
			}//Of if
		}//Of while
		
		return resultString;
	}//Of depthFirstTraversal
	
	/**
	 *********************
	 * Unit test for depthFirstTraversal.
	 *********************
	 */
	public static void depthFirstTraversalTest() {
		// Test an undirected graph.
		int[][] tempMatrix = { { 0, 1, 1, 0 }, { 1, 0, 0, 1 }, { 1, 0, 0, 0}, { 0, 1, 0, 0} };
		Graph tempGraph = new Graph(tempMatrix);
		System.out.println(tempGraph);

		String tempSequence = "";
		try {
			tempSequence = tempGraph.depthFirstTraversal(0);
		} catch (Exception ee) {
			System.out.println(ee);
		} // Of try.

		System.out.println("The depth first order of visit: " + tempSequence);
	}//Of depthFirstTraversalTest

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

		// Unit test.
		getConnectivityTest();

		breadthFirstTraversalTest();
		depthFirstTraversalTest();
	}// Of main
}

运行结果：