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
@brajeshmohanty25582 жыл бұрын
Thank u sooooo much u people are not less than any god.
@cyeg12c2 жыл бұрын
VS code theme name?
@numanakhtersiddiqui65732 жыл бұрын
Thanks for this course....
@numanakhtersiddiqui65732 жыл бұрын
which vs code theme are you using?
@adhirajbhattacharya85742 жыл бұрын
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_teacup2 жыл бұрын
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! 👍🏻
@junyorff122 жыл бұрын
The course is awesome, and the birds on the background make it perfect.
@jasimleskeboy2 жыл бұрын
I was searching for a graph video in java surprisingly I got this video instantly. How cool is that
@neelmoradiya13892 жыл бұрын
Did you completed it ?
@PeeyushIITMD2 жыл бұрын
Was just about to study this...and then this video dropped ...thanks team freecodecamp
@diegocassinera2 жыл бұрын
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.
@CodingCleverly2 жыл бұрын
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-kt3gh3 ай бұрын
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.
@blackmagician86808 ай бұрын
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.
@mohammedsalmanali012 жыл бұрын
Needed so much at this time. I was about to start Graphs
@herrforehead37452 жыл бұрын
I have graph theory this year, glad to see this
@b_charlie_d5232 Жыл бұрын
Thanks for expanding my understanding of graphs. : )
@jordanyoung18362 жыл бұрын
This would definitely benefit me in my future career
@JassCodes2 жыл бұрын
Thank You.. This is very much needed for me 🙂
@gamifycoding89272 жыл бұрын
Graph Algorithms in Java us very very helpful
@belalelhagrasy66212 жыл бұрын
Guys what is the best book or free course to learn computer architecture?
@anuraggoswami35342 жыл бұрын
For more depth watch take u forward new graph playlist
@francescos7361 Жыл бұрын
Thanks for this programming course.I appreciate a lot .
@yevsell2 жыл бұрын
God, I needed this so much. Thank you so much
@blackmagician86808 ай бұрын
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.
@watamote8694 Жыл бұрын
I'm at a beginner level Please make a video on Graph algorithm with python
@worldtop_32 жыл бұрын
Dynamic programming algorithm Java full course upload koro
@shady50632 жыл бұрын
nah this is scary, i searched for Graph course IN JAVA today on youtube... this drops after 2 hours...
@brajeshmohanty25582 жыл бұрын
Cause god want u to learn java
@farisabufarha5312 жыл бұрын
what's the difference between this video and the previous one u published ?
@akr280389 ай бұрын
he sure likes long variable/method names
@begumunal9367 Жыл бұрын
How can I print the start, end value, and paths from start to finish in my graph using DFS?
@grotsunfull2 жыл бұрын
Nice job!
@rafaelsousa1495 Жыл бұрын
Great content!
@КонстантинЕфимов-х2в2 жыл бұрын
I think, you may use the number of years of friendship between Peter and Jordan for weighted graph.
@CodingCleverly2 жыл бұрын
I like that 🙂
@GlobalYoung72 жыл бұрын
thank you ❤
@mikhailwiseman52962 жыл бұрын
Vscod with Java ? Weird
@cyeg12c2 жыл бұрын
VS code theme name?
@vuanh40842 жыл бұрын
Thank you so much.
@CodingCleverly2 жыл бұрын
You're Welcome! 🙂
@austinscott46952 жыл бұрын
Awesome
@random_things20232 жыл бұрын
I'm here again
@bogdanjovanovic27372 жыл бұрын
Does anyone know the name of VS code theme?
@novagames57192 жыл бұрын
Degult darks or something
@bogdanjovanovic27372 жыл бұрын
@@novagames5719 It's called codeSTACKr Theme
@offorjohn9 ай бұрын
Nice.
@yenosibinamakanjuola924926 күн бұрын
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) ; } } }
@shalenmathew2 жыл бұрын
Why are u crashing the course man 😠
@user23724 Жыл бұрын
This guy is awful at explaining things but yeah free tutorial so it’s fairly good