Neural Lantern (@neurallantern)

Graph Connectedness Explained: Connected Strongly Connected and Weakly Connected https://www.youtube.com/watch?v=u1D6huK1DCA Hello there. Lets talk about graphs and whether they are connected or not or maybe whether they are strongly connected versus weakly connected. We look at undirected graphs first and show what makes a graph connected meaning every node can reach every other node by a path. We add edges and check the connections step by step while also noting subgraphs. Then we switch to directed graphs and explain strongly connected versus weakly connected. Strongly connected follows the edge directions for every path. Weakly connected ignores the directions and checks if the graph would still be connected. Examples show how adding edges changes the status of the graph. 00:00 Introduction to Graph Connectedness 00:01 Drawing Nodes and a Disconnected Graph 01:56 Defining a Connected Graph 03:21 Introducing Subgraphs 04:48 Adding Edges to Create a Connected Graph 06:32 Adding Directions to Create a Directed Graph 08:03 Strongly Connected Versus Weakly Connected 08:34 Removing an Edge to Show Disconnection 09:29 Checking and Achieving Weak Connectivity 11:18 Adding Edges to Create a Strongly Connected Graph 13:20 Confirming the Strongly Connected Graph 13:32 Conclusion 14:17 Outro 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 graph theory, connected graph, strongly connected graph, weakly connected graph, undirected graph, directed graph, graph connectedness, nodes and edges, graph paths, data structures, subgraphs, graph algorithms