Scribd Logo
Upload

Welcome to Scribd!

  • ROLDAN AdjacencyList - Java

    Uploaded by

    Daniela Roldan
    9 views2 pages
    This Java code defines an adjacency list to represent a graph. It initializes an ArrayList to store the adjacency list and adds empty ArrayLists for each vertex. It then adds edges by inserting the connected vertices into the appropriate ArrayLists. Finally, it prints the adjacency list by iterating through the vertices and their connected lists.

    Original Description:

    Original Title

    ROLDAN AdjacencyList.java

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Java code defines an adjacency list to represent a graph. It initializes an ArrayList to store the adjacency list and adds empty ArrayLists for each vertex. It then adds edges by inserting the connected vertices into the appropriate ArrayLists. Finally, it prints the adjacency list by iterating through the vertices and their connected lists.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    9 views2 pages

    ROLDAN AdjacencyList - Java

    Uploaded by

    Daniela Roldan
    This Java code defines an adjacency list to represent a graph. It initializes an ArrayList to store the adjacency list and adds empty ArrayLists for each vertex. It then adds edges by inserting the connected vertices into the appropriate ArrayLists. Finally, it prints the adjacency list by iterating through the vertices and their connected lists.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    import java.util.

    *;

    public class AdjacencyList{

    public static void main(String[] args){

    ArrayList<ArrayList> AList = new ArrayList<>();

    char[] vert = {'A' , 'B' , 'C' , 'D' , 'E' , 'F' , 'G'}; int num = 7;

    for(int i = 0; i < num; i++){

    AList.add(new ArrayList<>());

    AList.get(0).add('B');

    AList.get(1).add('A');

    AList.get(1).add('C');

    AList.get(2).add('B');

    AList.get(2).add('D');

    AList.get(2).add('E');

    AList.get(3).add('C');

    AList.get(3).add('E');

    AList.get(3).add('F');

    AList.get(3).add('G');

    AList.get(4).add('C');

    AList.get(4).add('D');

    AList.get(4).add('F');

    AList.get(5).add('D');

    AList.get(5).add('E');

    AList.get(6).add('D');

    int y = 0;

    for(int i = 0; i < num; i++, y++){


    System.out.println(vert[y]+ ": " + AList.get(i));

    You might also like