图BFS和DFS和栈、队列自实现

package graph;

import java.util.Arrays;

/**
 * @auther 张弢
 * @create 2022-12-12 20:26
 */
public class GraphTest {
    public static void main(String[] args) {
        //创建节点
        MyVertex v1=new MyVertex("A");
        MyVertex v2=new MyVertex("B");
        MyVertex v3=new MyVertex("C");
        MyVertex v4=new MyVertex("D");
        MyVertex v5=new MyVertex("E");
        Graph graph=new Graph(5);
        graph.addVertex(v1);
        graph.addVertex(v2);
        graph.addVertex(v3);
        graph.addVertex(v4);
        graph.addVertex(v5);
        graph.addEdge("A","B");
        graph.addEdge("A","C");
        graph.addEdge("A","E");
        graph.addEdge("C","E");
        graph.addEdge("C","D");

        for (int[] a:graph.adjMax){
            System.out.println(Arrays.toString(a));
        }

//        graph.DFS();//桟实现--深度遍历优先
        graph.DFS_recursion(0);//递归实现--深度遍历优先
//        graph.BFS();//队列实现--广度遍历优先


    }
}

以上测试类

以下各实现类

package graph;

import fuxi.queue.LoopQueue;
import fuxi.queue.QueueTest;

/**
 * @auther 张弢
 * @