Graph using Adjacency List in Java

Implement Graph in Java.. using Adjacency List. Part I
An Adjacency List is Nothing but and Array of Linked List which is more memory efficient than Adjacency Matrix for sparse graph.

[muiscnight]

thanks the only *simple* java graph code tutorial I could find!

[germansantiagoramospena]

Excellent! Thank you so much for your explanation!

[MrEdinaldolaroque]

Very simple and clear way of teaching a somewhat complex subject! Thanks for sharing!

[himanskss]

very clean code and great explanation, thanks.

[harveyroper]

Really didnt expect you to consider big O in this toutorial. Really indepth and quality toutorial. Thanks :)

[scotthofbauer]

this is a super helpful video, very impressed with your ability to demonstrated graphs using Adjacency List!

[PetBuddies]

Thank you So much! You made it look so simple to do!!! I was struggling to understand this

[kumarsatyam]

The simplest way ever. Super duper like

[sanandadeysarkar]

Explanation is really good. loved the video. Very helpful. Thank you.

[JonatanGuitarMusic]

where can I find the implementation where you use hashmaps?

[charlieansell]

hi do you have a tutorial on how to run dijkstras algorithm on this graph structure?

[rakeshr.a]

thanks man, after one day of searching !!!

[hassanforever]

You can add at the end of LinkedList too it is also O(1) as java maintain tail of LinkedList too.

[gordonnorthpieganiii]

Just wondering if you can do this where your vertices are strings and how to implement

[lazizshamsiev]

Thank you for simplified lecture, can you also provide the code, please

[JaskaranSingh-ojuq]

what happens if i want to keep the node value like 101, how arrays could be possible in use case, it will go out of bound since size of array is only 10??

[sammy]

At 10:10, you say inserting at the end of a linked list is O(n). This is false - adding to a link list, either at the beginning or end, is O(1).

[rajeshdansena]

10:30 to 10:41 You added edge between 0-2 and 0-5 It added edges for 0 in the LinkedList but didn't added Edge in LinkedList of 2 and 5. Since It is the representation of un-directed graph, Don't you think we need to add for 2 and 5 also? Because when someone lookup for any connection between 2 and 0 (Not between 0 and 2) will give false, which is false. Appreciate your response.
PS : You are awesome! Keep it up :)

[akshitsharma]

Can you explain the use of variable w??

[koudiabouchra]

please can u help me I need a code for creating a matrice d'incedence and it's dictionnaire and also it's matrice of adjacent