Neural Lantern (@neurallantern)

Directed Unweighted Graph: Edge List Representation https://www.youtube.com/watch?v=p3oEf5HBpK8 Hello there. Let's talk about representing a directed, unweighted graph inside your machine using an edge list. We start with the vertices, then list every outgoing edge as a start-end pair. Direction matters now, so the order in each tuple is the start node first and the end node second. Then we upgrade the list: swap node values for indexes so you can jump to any vertex in constant time. Scanning edges is still linear in the number of edges, but you no longer scan the whole vertex list too. Next video: directed and weighted, same edge list idea. Subscribe if this helped. Leave a comment if something is unclear. 00:00 Intro to directed unweighted edge lists 01:24 Adding directions to the graph 02:32 Graph as vertices plus edges 03:22 Building the vertex list 04:29 Starting the edge list 05:54 Why tuple order matters 06:53 Listing outgoing edges by node 09:32 Counting the edges 10:26 Linear-time scan problem 11:34 Index-based edge list 13:20 Constant-time vertex lookup 14:35 Recap and next video 15:06 Subscribe and wrap-up =-=-=-=-=-=-=-=-= 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, directed graph, unweighted graph, graph representation, adjacency, graph theory, data structures, vertices and edges, directed edges, graph tutorial, computer science, programming graphs, index optimization, constant time lookup, linear time edges