lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Complete "longest common ..." examples (#100)

Browse Source 
* no else return

* fix var ref

* fix importing/requiring dependencies

* complete longest common examples
This commit is contained in:
Max Beatty
2019-03-28 14:52:55 -07:00
committed by Aditya Bhargava
parent c23ca90b83
commit 5b675cc2e8
22 changed files with 235 additions and 125 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
06_breadth-first_search/javascript/01_breadth-first_search.js
View File

@@ -1,7 +1,5 @@
'use strict';
function person_is_seller(name) {
return name[name.length-1] === 'm';
return name[name.length - 1] === "m";
}
const graph = {};
@@ -14,7 +12,6 @@ graph["peggy"] = [];
graph["thom"] = [];
graph["jonny"] = [];
function search(name) {
let search_queue = [];
search_queue = search_queue.concat(graph[name]);
@@ -25,17 +22,16 @@ function search(name) {
// Only search this person if you haven't already searched them
if (searched.indexOf(person) === -1) {
if (person_is_seller(person)) {
console.log(person + ' is a mango seller!');
console.log(person + " is a mango seller!");
return true;
} else {
search_queue = search_queue.concat(graph[person]);
// Marks this person as searched
searched.push(person);
}
search_queue = search_queue.concat(graph[person]);
// Marks this person as searched
searched.push(person);
}
}
return false;
}
search('you'); // thom is a mango seller!
search("you"); // thom is a mango seller!