Scribd
Upload
14 views3 pages

JavaScript Modules and BFS Guide

The document discusses different types of modules in JavaScript including local, built-in, and commonjs modules. It explains module scope, caching, and differences between browser and node.js. It also covers importing and exporting in ES modules.

Uploaded by

swethareddyextra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
14 views3 pages

JavaScript Modules and BFS Guide

The document discusses different types of modules in JavaScript including local, built-in, and commonjs modules. It explains module scope, caching, and differences between browser and node.js. It also covers importing and exporting in ES modules.

Uploaded by

swethareddyextra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

module.

exports vs exports
3 types of modules :
local
built-in

v8
javascript run time environment
javascript engine
module scope
module wrapper
module caching
browser vs node.js
Ecma script
node js - open source , cross platform , javascript runtime environment

commonjs - esmodules

file extension for modules in esmodules is .mjs not .js

2 types to import/export in esmodules

import function_name from "path" export default function_name


export default () => {} //direct function

export default { add ,sub}


can export with out default keyword also

buffer can be used without importing - bcz it is a global obj


error first callback
writeFile - overwrites its content

// Javacript Program to print BFS traversal from a given


// source vertex. BFS(int s) traverses vertices
// reachable from s.

// This class represents a directed graph using


// adjacency list representation
class Graph
{
// Constructor
constructor(v)
{
this.V = v;
this.adj = new Array(v);
for(let i = 0; i < v; i++)
this.adj[i] = [];
}

// Function to add an edge into the graph


addEdge(v, w)
{
// Add w to v's list.
this.adj[v].push(w);
}

// Prints BFS traversal from a given source s


BFS(s)
{
// Mark all the vertices as not visited(By default
// set as false)
let visited = new Array(this.V);
for(let i = 0; i < this.V; i++)
visited[i] = false;

// Create a queue for BFS


let queue=[];

// Mark the current node as visited and enqueue it


visited[s]=true;
queue.push(s);

while(queue.length>0)
{
// Dequeue a vertex from queue and print it
s = queue[0];
console.log(s+" ");
queue.shift();

// Get all adjacent vertices of the dequeued


// vertex s.
// If an adjacent has not been visited,
// then mark it visited and enqueue it
this.adj[s].forEach((adjacent,i) => {
if(!visited[adjacent])
{
visited[adjacent]=true;
queue.push(adjacent);
}
});
}
}
}

// Driver program to test methods of graph class

// Create a graph given in the above diagram


g = new Graph(4);
g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);
console.log("Following is Breadth First Traversal " +
"(starting from vertex 2) ");

g.BFS(2);

// This code is contributed by Aman Kumar.

You might also like