Java实现图的深度、广度优先搜索详细代码

Graph类：定义无向图、DFS与BFS

import java.util.ArrayList;
import java.util.LinkedList;

public class Graph {
    private ArrayList<String> vertexList;
    private int[][] edges;
    private boolean[] isVisted;
    private int numOfEdges;

    public Graph(int n){
        edges = new int[n][n];
        vertexList = new ArrayList<>();
        isVisted = new boolean[n];
    }

    public void insertVertex(String s){
        vertexList.add(s);
    }

    public void insertEdge(int v1, int v2, int weight){
        edges[v1][v2] = weight;
        edges[v2][v1] = weight;
        numOfEdges++;
    }

    public int getFirstNeighbor(int index){
        for(int i = 0; i < vertexList.size(); i++){
            if(edges[index][i] > 0){
                return i;
            }
        }
        return -1;
    }

    public int getNextNeighbor(int v1, int v2){
        for(int i = v2 + 1; i < ver