Algorithms: Graph Data Structure with 3 Javascript Implementations

In this video, Liz Gross walks us through the foundations for understanding what graphs are, how they may appear in a coding interview, how to implement graphs using three different javascript approaches as well as an overview of key terminology.

0:44 Objectives
1:42 Overview of graphs
4:14 Implementation 1: vertex & edge list
20:52 Implementation 2: adjacency matrix
40:33 Implementation 3: adjacency list
56:24 Directed vs undirected graphs
59:03 Weighted vs unweighted graphs
1:00:00 Cyclic and acyclic graphs
1:02:00 Dense vs sparse graphs
1:07:00 Recap

Our next video will cover graph traversals and common graph interview questions. Be sure to subscribe to our channel for updates on new releases.

[nunyabizness]

You literally are the best teacher of the graph data structure I've ever seen. Finally understand graphs. You make a full course on data structures and algorithms and you have a customer right here!!!. Absolutely brilliant!! 👏👏👏

[lionmike]

You explain so well! Wow!! I can really comprehend and follow what you are teaching compared to other videos I have seen.

Thank you!!

[sophiali-CBR-AU]

This is the best tutorial about Graph, I finally understand what it is. Thank you so much👍

[enihar]

Absolutely loved the video and the way you explained it. Looking forward to more such tutorials

[supriyapase]

The best explanation for graphs! Hey Liz, please do cover dynamic programming and related interview questions in the future! Thanks!

[dssagar]

34:27 Just wondering if we could use indexOf node instead of vertexIds, it can still give us the right value, correct? We might not need to build a seperate key-value pair for indexes.Just thinking.

[ramakrishnancs]

Your videos are amazing! All I have to do is watch em once! And it's in JS :') Thanks a lot, keep doing the amazing work you're already doing!

[mehmoodulhaq]

I never knew before, she had such an amazing explanation of Graphs; Bravo!

[evandroLG]

Absolutely great! Keep going with these algorithms / data structure videos, they are just awesome! :)

[kumarsuman]

Very informative and intuitive. This is exactly graph should be taught by mapping intuition into code. Absolutely you nailed it 🙌🏼🙌🏼👏👏

[shujamigo]

very nice explanation. thanks for sharing

[faithmorante]

Now I have some knowledge about graphs! Used to always hurt my brain lol

[sophiali-CBR-AU]

I am new to programming, maybe I am wrong. For the isconnected() method of class Node in Adjacency List, the return result of map() is an array of true or false. e.g. the return value of nodeA.isConnected(nodeB) is [true, false]. I think use some() method in the vertices list + edges list will get the result of true.

[dianav]

I def got asked about adjacency matrix in an interview

[MrLuigiVr]

As an Engineering student, the math shown doesn't sound right. Now it's probably a lapsus but n^2 is not exponential growth.

[MrZiyak]

Hey so while this video is good I prefer the videos where there would be graphics explaining the problem in detail before solving the problem.

[JacekSmolak]

In the Node class, the isConnected can simply be: `return this.edgesList.indexOf(node) > -1` as the are the same objects (if found).

[hamzalakhal]

using Typescript and ES6 : we can opt for :

isConnected(node:MyNode){

const foundNode = node.value===_node.value) ;

return foundNode ? true : false ;
}