Brute force method / adjacency table depth first directed weighted graph undirected weighted graph

package xcrj.kchalgorithm.bruteForce.graph;

import javafx.scene.shape.Arc;

import java.util.ArrayList;
import java.util.List;

/** *  Adjacency table stores graph  */
public class DFSAdjTable {
    
    static int n = 5;
    static int[] visited = new int[n];

    /** *  initial ：vertex Feel free to look 1 A little bit  */
    static void dfs(ALGraph alGraph, int vertex) {
    
        visited[vertex] = 1;
        //  take vertex First edge point 
        ArcNode p = alGraph.getAdjList().get(vertex).getFirstArcNode();
        while (p != null) {
    
            //  Not visited 
            if (0 == visited[p.getAdjVertex()]) {
    
                //  Depth takes down an edge point 
                System.out.println("  spot " + vertex + "- A weight " + p.getWeight() + "-> spot " + p.getAdjVertex());
                dfs(alGraph, p.getAdjVertex());
            }
            //  Depth first , Breadth second 
            p = p.getNextArcNode();
        }
    }

    /** *  Directed weighted graph  */
    public static void directedWeightedGraph() {
    
        //  Initialize adjacency table 
        int n = DFSAdjTable.n;
        int e = 6;
        ALGraph alGraph = new ALGraph();
        alGraph.setN(n);
        alGraph.setE(e);
        // adjList,AVNode The vertices ,ArcNode Edge point 
        List<AVNode> adjList = new ArrayList<>(n);
        // 0 To 4
        AVNode avNode0 = new AVNode();
        avNode0.setNo(0);
        ArcNode arcNode04 = new ArcNode(6, 4, null);
        avNode0.setFirstArcNode(arcNode04);
        adjList.add(avNode0);
        // 1 To 0 2
        AVNode avNode1 = new AVNode();
        avNode1.setNo(1);
        ArcNode arcNode12 = new ArcNode(3, 2, null);
        ArcNode arcNode10 = new ArcNode(9, 0, arcNode12);
        avNode1.setFirstArcNode(arcNode10);
        adjList.add(avNode1);
        // 2 To 0 3
        AVNode avNode2 = new AVNode();
        avNode2.setNo(2);
        ArcNode arcNode23 = new ArcNode(5, 3, null);
        ArcNode arcNode20 = new ArcNode(2, 0, arcNode23);
        avNode2.setFirstArcNode(arcNode20);
        adjList.add(avNode2);
        // 3 To 4
        AVNode avNode3 = new AVNode();
        avNode3.setNo(3);
        ArcNode arcNode34 = new ArcNode(1, 4, null);
        avNode3.setFirstArcNode(arcNode34);
        adjList.add(avNode3);
        // 4
        AVNode avNode4 = new AVNode();
        avNode4.setNo(4);
        avNode4.setFirstArcNode(null);
        adjList.add(avNode4);
        alGraph.setAdjList(adjList);
        // dfs
        dfs(alGraph, 1);
    }

    /** *  Undirected weighted graph  */
    public static void undirectedWeightedGraph() {
    
        //  Initialize adjacency table 
        int n = DFSAdjTable.n;
        int e = 6;
        ALGraph alGraph = new ALGraph();
        alGraph.setN(n);
        alGraph.setE(e);
        // adjList,AVNode The vertices ,ArcNode Edge point 
        List<AVNode> adjList = new ArrayList<>(n);
        // 0 And 1 2 4 Connected to a 
        AVNode avNode0 = new AVNode();
        avNode0.setNo(0);
        ArcNode arcNode04 = new ArcNode(6, 4, null);
        ArcNode arcNode02 = new ArcNode(2, 2, arcNode04);
        ArcNode arcNode01 = new ArcNode(9, 1, arcNode02);
        avNode0.setFirstArcNode(arcNode01);
        adjList.add(avNode0);
        // 1 And 0 2 Connected to a 
        AVNode avNode1 = new AVNode();
        avNode1.setNo(1);
        ArcNode arcNode12 = new ArcNode(3, 2, null);
        ArcNode arcNode10 = new ArcNode(9, 0, arcNode12);
        avNode1.setFirstArcNode(arcNode10);
        adjList.add(avNode1);
        // 2 And 0 1 3 Connected to a 
        AVNode avNode2 = new AVNode();
        avNode2.setNo(2);
        ArcNode arcNode23 = new ArcNode(5, 3, null);
        ArcNode arcNode21 = new ArcNode(3, 1, arcNode23);
        ArcNode arcNode20 = new ArcNode(2, 0, arcNode21);
        avNode2.setFirstArcNode(arcNode20);
        adjList.add(avNode2);
        // 3 And 2 4 Connected to a 
        AVNode avNode3 = new AVNode();
        avNode3.setNo(3);
        ArcNode arcNode34 = new ArcNode(1, 4, null);
        ArcNode arcNode32 = new ArcNode(5, 2, arcNode34);
        avNode3.setFirstArcNode(arcNode32);
        adjList.add(avNode3);
        // 4 And 0 3 Connected to a 
        AVNode avNode4 = new AVNode();
        avNode4.setNo(4);
        ArcNode arcNode43 = new ArcNode(1, 3, null);
        ArcNode arcNode40 = new ArcNode(6, 0, arcNode43);
        avNode4.setFirstArcNode(arcNode40);
        adjList.add(avNode4);
        alGraph.setAdjList(adjList);
        //  Depth-first traversal 
        dfs(alGraph, 0);
    }

    public static void main(String[] args) {
    
// undirectedWeightedGraph();
        directedWeightedGraph();
    }
}