Hands-On Data Structures and Algorithms with JavaScript

Creating a bidirectional graph

We can start with logic for our graph by creating a new file under utils/graph.js, which will hold the edges and then provide a simple shortestPath method to access the Graph and apply the BFS algorithm on the graph that is generated, as shown in the following code:

var _ = require('lodash');class Graph {   constructor(users) {      // initialize edges      this.edges = {};      // save users for later access      this.users = users;      // add users and edges of each      _.forEach(users, (user) => {         this.edges[user.id] = user.friends;      });   }}module.exports = Graph;

Once we add the edges to our graph, it has nodes (user IDs), and edges are defined as the relationship between each user ID and friend in the friends array, which is available ...