Graph Data Structure | Part 3 | Adjacency Matrix Representation and Operations

Representing a graph data structure via a adjacency matrix. Chapters: 00:00 - Intro 00:41 - Adjacency Matrix 07:26 - Code (initialize Graph) 08:52 - Code (Add/Remove Edges) 11:15 - Code (Add/Remove Vertices) 14:37 - Pros & Cons 16:39 - Final Thoughts 📚 Links to topics I talk about in the video: Graph Data Structure: https://youtu.be/txvPdGHVIlc Types of Graph: https://youtu.be/6SqLy-QJreE 📘 A text based explanation is available at: https://studyalgorithms.com Code on Github: https://github.com/nikoo28/java-solutions/blob/master/src/main/java/util/Graph.java 📖 Reference Books: Starting Learn to Code: https://amzn.to/3sJm8Wl Favorite book to understand algorithms: https://amzn.to/4848xJH Favorite book for data structures: https://amzn.to/3P96YBv Get started for interview preparation: https://amzn.to/44Nn5du 🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalgorithms 🎥 My Recording Gear: Recording Light: https://amzn.to/3PdsViT Microphone: https://amzn.to/3Exv83x Recording Camera: https://amzn.to/3PwyN8e Tablet to sketch and draw: https://amzn.to/3ZdKVy7 Sketching Tool: https://amzn.to/45XJEgY Laptop to edit videos: https://amzn.to/460ofDu 💻 Get Social 💻 Follow on Facebook at: https://www.facebook.com/studyalgos Subscribe to RSS feeds: https://studyalgorithms.com/feed/ Join fan mail: http://eepurl.com/g9Dadv #graphs #programming #interview