Graph data Structure in Javascript

class Node {
  constructor(value) {
    this.value = value;
    this.neighbors = [];
  }
}

class Graph {
  constructor() {
    this.nodes = [];
  }

  addNode(node) {
    this.nodes.push(node);
  }

  addEdge(node1, node2) {
    node1.neighbors.push(node2);
    node2.neighbors.push(node1);
  }

  print() {
    for (const node of this.nodes) {
      console.log(node.value);
      for (const neighbor of node.neighbors) {
        console.log(`  ${neighbor.value}`);
      }
    }
  }
}

const graph = new Graph();

const node1 = new Node(1);
const node2 = new Node(2);
const node3 = new Node(3);
const node4 = new Node(4);
const node5 = new Node(5);

graph.addNode(node1);
graph.addNode(node2);
graph.addNode(node3);
graph.addNode(node4);
graph.addNode(node5);

graph.addEdge(node1, node2);
graph.addEdge(node1, node3);
graph.addEdge(node2, node4);
graph.addEdge(node3, node4);
graph.addEdge(node4, node5);

graph.print();

// 1
//   2
//   3
// 2
//   1
//   4
// 3
//   1
//   4
// 4
//   2
//   3
//   5
// 5
//   4

class Graph {
  constructor() {
    this.nodes = new Map();
  }

  addNode(node) {
    this.nodes.set(node, []);
  }

  addEdge(node1, node2) {
    this.nodes.get(node1).push(node2);
    this.nodes.get(node2).push(node1);
  }

  getNeighbors(node) {
    return this.nodes.get(node);
  }
}

// Create a graph
const graph = new Graph();

// Add nodes
graph.addNode('A');
graph.addNode('B');
graph.addNode('C');
graph.addNode('D');

// Add edges
graph.addEdge('A', 'B');
graph.addEdge('A', 'C');
graph.addEdge('B', 'D');

// Get neighbors of a node
console.log(graph.getNeighbors('A')); // Returns ['B', 'C']
console.log(graph.getNeighbors('D')); // Returns ['B']