学习笔记-深度优先搜索DFS寻找有向图环路实现

常用的图的存储结构主要有以下二种：邻接矩阵和邻接表

邻接矩阵与邻接表的对比：

1、当图中结点数目较小且边较多时，采用邻接矩阵效率更高。

2、当节点数目远大且边的数目远小于相同结点的完全图的边数时，采用邻接表存储结构更有效率。

有向图稀疏邻接矩阵结构寻找环路Java实现

import java.util.*;

import org.apache.commons.lang.StringUtils;

public class DFSSparseCycle {

	/** 点数 */
	private int vertexCount;
	/** 有向图的稀疏邻接矩阵 */
	private int[][] sparseAdjacencyMatrix;
	/** 点访问状态, 0未访问 1已访问 */
	private int[] vertexAccessStatus;
	/** 追踪栈 */
	private List<Integer> traceStack = new ArrayList<Integer>();
	/** 环列表 */
	private List<List<Integer>> cycles = new ArrayList<List<Integer>>();

	public DFSSparseCycle(int[][] sparseAdjacencyMatrix) {
		this.sparseAdjacencyMatrix = sparseAdjacencyMatrix;
		this.vertexCount = sparseAdjacencyMatrix.length;
		vertexAccessStatus = new int[vertexCount];
		Arrays.fill(vertexAccessStatus, 0);
	}

	public void findCycle() {
		for (int i = 0; i < vertexCount; i++) {
            vertexAccessStatus = new int[vertexCount];
			Arrays.fill(vertexAccessStatus, 0);
			findCycle(i);
		}
	}

	public void findCycle(int vertex) {
		if (vertexAccessStatus[vertex] == 1) {
			int j = 0;
			if ((j = traceStack.indexOf(vertex)) != -1) {
				List<Integer> cycle = new ArrayList<Integer>();
				while (j < traceStack.size()) {
					cycle.add(traceStack.get(j));
					j++;
				}
				cycles.add(cycle);
				return;
			}
			return;
		}
		vertexAccessStatus[vertex] = 1;
		traceStack.add(vertex);

		for (int i = 0; i < vertexCount; i++) {
			if (sparseAdjacencyMatrix[vertex][i] == 1) {