graph Adjacency matrix

public class main {
    public static  void main(String[] args) {

        Graph graph=new Graph(5);
            graph.addNode('A');
        graph.addNode('B');
        graph.addNode('C');
        graph.addNode('D');
        graph.addNode('E');



        graph.addEdge(0,1);
        graph.addEdge(1,2);
        graph.addEdge(2,3);
        graph.addEdge(2,4);
        graph.addEdge(4,0);
        graph.addEdge(4,2);
        
        graph.checkEdge(1,3);

        graph.print();
    }
import java.util.ArrayList;

public class Graph {
    int[][] matrix;
    ArrayList<Node> list;
    Graph(int size){
        matrix=new int[size][size];
        list=new ArrayList<>();
    }

    public void addNode(char data){
      list.add(new Node(data));

    }

    public void addEdge(int src,int dst){

        matrix[src][dst]=1;
    }


    public boolean checkEdge(int src,int dst){
      return matrix[src][dst]==1;
    }
    public void print(){
        System.out.print("  ");
        for(int i=0;i<list.size();i++){
            System.out.print(list.get(i).data+" ");
        }
        System.out.println();
        for(int i=0;i<matrix.length;i++){
            System.out.print(list.get(i).data+" ");
            for(int j=0;j<matrix[i].length;j++){
                System.out.print(matrix[i][j]+" ");
            }
            System.out.println();
        }
    }
}
public class Node {
    char data;
    Node(char data){
        this.data=data;
    }
}



}