Hey everyone, I hope you learned something from our first class. We went over the basics of graphs as well as two different representations for them: adjacency matrices and adjacency lists. For those of you who didn't get a chance to finish the example implementation for an adjacency list, please try to finish that for homework before next class. You can submit your code by commenting your code on this post or you can send it to me in private chat next class, and I will take a look at your code. Also, if you guys do get a chance, for those who have not already, please complete the survey here: https://docs.google.com/forms/d/e/1FAIpQLSe-IRI7F_A8cux28QdC-I4qjHe6OWS36NxuVJs77ZSFYanlBg/viewform?usp=sf_link. It helps me get a sense of where you are at. If you guys wish to see the recording of the meetings if you are confused by something or just want to watch it again, they can be found at this shared Google Drive link: https://drive.google.com/drive/folders/1NJjv5MXajh5INqSboZ9QXgXHj2LE30JQ?usp=sharing. This should include all the recordings that we will add in the future as well, separated into folders by class. You might need to download the recordings first to be able to view them.