Graph Algorithms Crash Course (with Java)

[@CodingCleverly]

Thank you once again for this fantastic opportunity. I'd like to announce that I'll be doing an Ultimate Data Structures and Algorithms Series on my channel. New videos will be uploaded every Saturday and Wednesday. The link to the channel: kzbin.info

[@brajeshmohanty2558]

Thank u sooooo much u people are not less than any god.

[@cyeg12c]

VS code theme name?

[@numanakhtersiddiqui6573]

Thanks for this course....

[@numanakhtersiddiqui6573]

which vs code theme are you using?

[@adhirajbhattacharya8574]

hey. great video. wanted to ask why your new dsa playlist is unavailable in my country, india. can you make it available to india as well please. shows "15 unavailable videos are hidden".

[@frosty_teacup]

This was the absolute most PERECT time for this. I'm taking my DSA course at uni right now and I really need to know this to start practicing Leetcode! I'm also only familiar with Java right now so I was thinking where I would find the time to get comfortable enough with Python in order to start doing questions. You've solved so many of my problems FCC! 👍🏻

[@jasimleskeboy]

I was searching for a graph video in java surprisingly I got this video instantly. How cool is that

[@neelmoradiya1389]

Did you completed it ?

[@junyorff12]

The course is awesome, and the birds on the background make it perfect.

[@PeeyushIITMD]

Was just about to study this...and then this video dropped ...thanks team freecodecamp

[@diegocassinera]

The code described here has tons of bugs. For example adding a edge via the Graph class has different result as adding one directly by the edge. A deleted edge, is removed from the edge list, however if the edge had vertexes pointing to it those connections are left in place.

[@CodingCleverly]

You could be correct. We can improve this algorithm to cover all the edge cases, but in terms of concepts and overall functionality, this is a great place to start. 🙂

[@Me-kt3gh]

Overall it's a great crash course though. CodingCleverly does a great job explaining what he's doing, going back and forth between classes to show what he is referencing, and actually explaining what each line (and in a lot of cases what each keyword and variable) is doing.

[@blackmagician8680]

There is typo at 1:22:48 The correct line should be int alternative = distances.get(current.getData()) + edge.getWeight(); Basically we need to add the distances separately and not inside distances.get(). Hope everyone gets the point.

[@mohammedsalmanali01]

Needed so much at this time. I was about to start Graphs

[@b_charlie_d5232]

Thanks for expanding my understanding of graphs. : )

[@herrforehead3745]

I have graph theory this year, glad to see this

[@JassCodes]

Thank You.. This is very much needed for me 🙂

[@francescos7361]

Thanks for this programming course.I appreciate a lot .

[@gamifycoding8927]

Graph Algorithms in Java us very very helpful

[@yevsell]

God, I needed this so much. Thank you so much

[@anuraggoswami3534]

For more depth watch take u forward new graph playlist

[@КонстантинЕфимов-х2в]

I think, you may use the number of years of friendship between Peter and Jordan for weighted graph.

[@CodingCleverly]

I like that 🙂

[@belalelhagrasy6621]

Guys what is the best book or free course to learn computer architecture?

[@akr28038]

he sure likes long variable/method names

[@blackmagician8680]

Hi @CodingCleverly any specific reason for not using Map instead of Dictionary in Dijkstra algo? As many of recent Java devs are not comfortable/familiar with Dictionary.

[@shady5063]

nah this is scary, i searched for Graph course IN JAVA today on youtube... this drops after 2 hours...

[@brajeshmohanty2558]

Cause god want u to learn java

[@begumunal9367]

How can I print the start, end value, and paths from start to finish in my graph using DFS?

[@grotsunfull]

Nice job!

[@GlobalYoung7]

thank you ❤

[@rafaelsousa1495]

Great content!

[@farisabufarha531]

what's the difference between this video and the previous one u published ?

[@watamote8694]

I'm at a beginner level Please make a video on Graph algorithm with python

[@worldtop_3]

Dynamic programming algorithm Java full course upload koro

[@cyeg12c]

VS code theme name?

[@vuanh4084]

Thank you so much.

[@CodingCleverly]

You're Welcome! 🙂

[@bogdanjovanovic2737]

Does anyone know the name of VS code theme?

[@novagames5719]

Degult darks or something

[@bogdanjovanovic2737]

@@novagames5719 It's called codeSTACKr Theme

[@pranaycc]

Are you reading my mind?

[@mikhailwiseman5296]

Vscod with Java ? Weird

[@Octen20]

I'm here again

[@shalenmathew]

Why are u crashing the course man 😠

[@austinscott4695]

Awesome

[@offorjohn]

Nice.

[@user23724]

This guy is awful at explaining things but yeah free tutorial so it’s fairly good

[@A-Karim2003]

100% agreed

[@shreysharma726]

nice ...

[@TheJabberwahh]

Java on vscode? no thx

[@saijiang]

many many many bugs

[@ali_m_]

Howdy

[@kopek3105]

>java bruh

[@KJ-tq3sm]

HUH?

[@auniquehandle]

bruh can't even make a good example haha

[@earninglegends7085]

❤️❤️

[@yenosibinamakanjuola9249]

Hey the dfs is wrong in the situation where the Vertex has no neighbours unless the Vertex of the graph has a connecting edge with itself. The visistedCertex should be added before the for looop public static void dfs(Vertex startingNode , ArrayList visitedVertex){ visitedVertex.add(startingNode) ; for(Edge neighbours : startingNode.getEdges()){ if(!visitedVertex.contains(neighbours.getEnd())){ dfs(neighbours.getEnd() , visitedVertex) ; } } }