Merge branch 'master' of https://github.com/TheAlgorithms/JavaScript

merge forked with upstream

Author: abdullyahuza

Graphs/BreadthFirstSearch.js

@@ -1,3 +1,5 @@
+import Queue from '../Data-Structures/Queue/Queue'
+
 /**
  * Breadth-first search is an algorithm for traversing a graph.
  *
@@ -12,11 +14,12 @@ export function breadthFirstSearch (graph, startingNode) {
  const visited = new Set()
 
  // queue contains the nodes to be explored in the future
- const queue = [startingNode]
+ const queue = new Queue()
+ queue.enqueue(startingNode)
 
- while (queue.length > 0) {
+ while (!queue.isEmpty()) {
  // start with the queue's first node
- const node = queue.shift()
+ const node = queue.dequeue()
 
  if (!visited.has(node)) {
  // mark the node as visited
@@ -25,7 +28,7 @@ export function breadthFirstSearch (graph, startingNode) {
 
  // put all its neighbors into the queue
  for (let i = 0; i < neighbors.length; i++) {
- queue.push(neighbors[i])
+ queue.enqueue(neighbors[i])
  }
  }
  }

Graphs/BreadthFirstShortestPath.js

@@ -1,3 +1,4 @@
+import Queue from '../Data-Structures/Queue/Queue'
 /**
  * Breadth-first approach can be applied to determine the shortest path between two nodes in an equi-weighted graph.
  *
@@ -18,11 +19,12 @@ export function breadthFirstShortestPath (graph, startNode, targetNode) {
 
  // queue contains the paths to be explored in the future
  const initialPath = [startNode]
- const queue = [initialPath]
+ const queue = new Queue()
+ queue.enqueue(initialPath)
 
- while (queue.length > 0) {
+ while (!queue.isEmpty()) {
  // start with the queue's first path
- const path = queue.shift()
+ const path = queue.dequeue()
  const node = path[path.length - 1]
 
  // explore this node if it hasn't been visited yet
@@ -42,7 +44,7 @@ export function breadthFirstShortestPath (graph, startNode, targetNode) {
  }
 
  // queue the new path
- queue.push(newPath)
+ queue.enqueue(newPath)
  }
  }
  }