/*
 * AdjListGraph.kt
 * 
 * This is Dave Musicant's AdjListGraph.kt from Fall 2024,
 * which was ported by Dave from the Java code at
 * https://www.programiz.com/dsa/graph-adjacency-list.
 * 
 * Modified lightly by Tanya Amert for Spring 2025.
 * 
 * Illustrates an implementation of a Graph via adjacency lists.
 */

 // Add an edge to the graph
fun addEdge(am: MutableList<MutableList<Int>>, s: Int, d: Int) {
    am[s].add(d)
    am[d].add(s)
}

// Print the graph
fun printGraph(am: MutableList<MutableList<Int>>) {
    for (i in 0..<am.count()) {
        println("\nVertex $i:")
        for (j in 0..<am[i].count()) {
            print(" -> ${am[i][j]}")
        }
        println()
    }
}

// Test out the graph code
fun main() {

    // Create the graph
    val V = 5;
    val am = mutableListOf<MutableList<Int>>()

    for (i in 0..<V) {
        am.add(mutableListOf<Int>())
    }

    // Add edges
    addEdge(am, 0, 1)
    addEdge(am, 0, 2)
    addEdge(am, 0, 3)
    addEdge(am, 1, 2)

    printGraph(am)
}