Search⌘ K

How to Create Graphs in JavaScript

Explore the process of creating weighted undirected graphs in JavaScript by implementing adjacency list representations. Understand how to store vertices and edge weights efficiently and apply these concepts to build a travel planner project that calculates travel times between cities.

Introduction

To start the project, we'll create a weighted undirected graph, in which the weight of each edge between two cities will represent the travel time to reach from one city to the other city. We'll implement the code to create this graph using adjacency list representation. In this technique, we store the graph in an array (say A), whose each element is also an array. Each element of the arrayAiA_{i}​ is a list that contains all the vertices that are adjacent to vertex i. While creating a weighted graph, the weight associated with each edge will be stored along with the vertex in the list. Each element in the list will be of size two, where the first element will denote the vertex and the other element will denote the weight for that edge. In an undirected graph, if vertex j is in the list Ai ...