Neural Lantern (@neurallantern)

How to Represent an Unweighted Undirected Graph with an Edge List https://www.youtube.com/watch?v=eIBfYgU1QIk Learn how to represent an unweighted undirected graph using an edge list. We build a sample graph with nodes and edges, then show the vertex list and edge list as tuples. See why storing indexes instead of node values makes lookups faster in constant time. Follow along as we list every connection without duplicates. This is the first in a series covering all four combinations of weighted and directed graphs with edge lists. 00:00 Introduction to Edge List Representation 00:56 Drawing a Sample Graph with Nodes 02:05 Adding Undirected Unweighted Edges 03:10 Graph as a Tuple of Vertex and Edge Lists 03:40 Building the Vertex List 04:24 Storing Nodes as Objects with Indexes 06:13 Creating the Edge List of Tuples 07:00 Listing Edges by Node Values 11:36 Limitations of Storing Node Values 12:30 Switching to Index-Based Edge List 14:08 Constant-Time Lookups with Indexes 16:54 Summary of the Edge List Method 17:16 Preview of Next Videos in the Series 17:44 Closing Remarks and Subscribe Request =-=-=-=-=-=-=-=-= Thanks for watching! Find us on other social media here: - https://www.NeuralLantern.com/social - Twitter / X: https://x.com/NeuralLantern - Rumble: https://rumble.com/c/c-3696939 - BitChute: https://www.bitchute.com/channel/pg1Pvv5dN4Gt - Daily Motion: https://www.dailymotion.com/neurallantern - Minds: https://www.minds.com/neurallantern/ - Odysee: https://odysee.com/@NeuralLantern:5 Please show your support! - Buy me a coffee: https://ko-fi.com/neurallantern - Subscribe + Sharing on Social Media - Leave a comment or suggestion - Subscribe to the Blog: https://www.NeuralLantern.com - Watch the main "pinned" video of this channel for offers and extras edge list, undirected graph, unweighted graph, graph representation, vertex list, node list, graph data structure, edge tuples, graph theory basics, coding graphs, index based edges, constant time lookup, undirected unweighted, graph algorithms, adjacency alternative