Graph Search Algorithms in 100 Seconds - And Beyond with JS

Do you want to see more videos with a technical "interview prep" focus? Usually I cover practical projects, so curious to know what you think...

Thank You So Much for this wonderful video...🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

Amazing video!! Practical problems are ALWAYS better than abstract ones.

A course on DSA please

Your channel is sooooooo awesome, congratulations! One question that I have: Is the set used at the DFS function a memoization technique?

did you post the code somewhere?

Very good video. I implemented in Go for myself, and turned out it was DFS 😂

more algorithms PLEASEEEEEEEEE !!!!!!!!!!!!!!!!!!!!!!!

Thank you！This taught me more in a few mins than my professor in hours!

This channel is a gem

The beginning feels like Gordon Ramsay made it. Love is!

Some people were really born to teach.Congrats

Graph theory… the only class I almost straight flunked in college and still shiver thinking about. Maybe it’s easier now with code, but in theory it’s confusing AF

I wish it wasn't so zoomed in and double spaced

this video is 629 seconds long

Please do more videos like these

Very clear instructions. I only know Python and I completely understood your coding process with Javascript.

Quality

man this is gold

Add start to initial set in bfs to avoid an extra search of the node you started with

thank you, will be practising a lot

wow so fantastic, so fast and all necessary details/CRITICAL details are covered with real time application.

This really makes me so excited to dig deeper into the topic.

Keep posting more informative videos like this.
And could be also attach code in the video description in popular 3 languages like python, Java, c++ along with javascript

tried a lot not to laugh, but couldn't control everytime he said 'bangcock'

Intresting

Phenomenal content, thank you so much!!
Just have one question:
In the implementation of the BFS algo, the starting node should also be added to the visited Set before the while loop starts, right?

Fatastic .... 1 minute .... my full page is covered with expensive knowledge ..... How good you are ❤. It make me think of how much knowledge creator fed in you..... brilliant

Shouldn't dfs(destination, visited) be precede by return dfs(destination, visited) ?

For the DFS approach, don't we need a check for the exit base case? (Something like 'if start != null") Or is it ok because we're using JavaScript and it will kind of fail semi-gracefully on its own anyway?

cool!

i wrote the same program are it is giving me this error ."Cannot read properties of undefined (reading 'push')".occuring at adjecencyList.get(destination).push(origin);

In 10 Min, I came out with a better understanding of graphs then I have in the previous attempts (which was a lot). Thanks for making graphs make sense.

CREDITS: goto (stackoverflow)

const airports = "PHX BKK OKC JFK LAX MEX EZE HEL LOS LAP LIM".split(" ");

const routes = [
["PHX", "LAX"],
["PHX", "JFK"],
["JFK", "OKH"],
["JFK", "HEL"],
["JFK", "LOS"],
["MEX", "LAX"],
["MEX", "BKK"],
["MEX", "LIM"],
["MEX", "EZE"],
["LIM", "BKK"]
];

const adjacencyList = new Map();

function addNode(airport) {
adjacencyList.set(airport, []);
}

function addEdge(origin, destination) {
adjacencyList.get(origin).push(destination);
const dest = adjacencyList.get(destination);

if (!dest) {
addNode(destination)
}
adjacencyList.get(destination).push(origin);
}

airports.forEach(addNode);

routes.forEach(route => addEdge(...route));

console.log("result");
adjacencyList.forEach((value, key) => {
console.log(key, value);
});

Quick Question: doesn't the function execution should stop after it hit 'Return'? why does the output shows JFK to LOS after it actually found the "BKK".

thanks

Bro! The way you explained this and the neatness of your codes I could grasp the Graph theory quickly. Please make a series.

This is such a great video!Thank you!!!!

this actually just helped me in a FANG interview, great stuff!

TBH BFS actually guarantees a solution (if it exists) and gives you the shortest path (if implemented correctly), so I guess to check if a path exists both BFS and DFS can work but if you want to find the shortest path use BFS.

The format of these videos is brilliant! 100 seconds intro and then, if you want it, some practical implementation.

Amazing vídeo!

That was great stuff...! Can you make a video about representing a graph for course dependencies, and if the dependencies have a cyclic reference or loop.

Really nice video! Although using map and set do add a O(logV) factor in the final complexity and, depending on how js handles popping elements from the front of the array, an O(V) factor

linear time based on edges... linear space based on nodes... O(n), O(m), respectively...

dam this is so much more helpful than the leetcode graph card, thank you so much!

He just solved the most difficult problem in the world 😳...

🔥

amazing

Hello, feeling newb here. where did u initialized the "steps" variable at?

Please lower down background music