Obtención de las componentes conexas en grafos no dirigidos | 16/25 | UPV

Title: Obtaining Connected Components in Undirected Graphs Description: This video explains how to obtain connected components in an undirected graph. It uses the access matrix if available and explains how to obtain it otherwise. Clarifying examples are provided. Jordan Lluch, C. (2024). Obtaining Connected Components in Undirected Graphs. https://riunet.upv.es/handle/10251/20... DER Automatic description: This video explains how to obtain connected components in an undirected graph. Important concepts such as the generated or induced subgraph of a set of vertices and the reach relation between vertices are reviewed. A key definition is presented: a subgraph of graph G is a connected component if it is connected and there is no other connected subgraph that strictly contains it. This video demonstrates how to obtain connected components by applying search algorithms such as BFS or DFS. Finally, it illustrates the relationship between the access matrix and connected components, highlighting that identical rows in the matrix correspond to vertices of the same connected component. Author: Cristina Jordan Lluch Course: This video is 16/25 of the Graph Theory: General Concepts course.    • Teoría de Grafos. Conceptos Generales.   Universitat Politècnica de València UPV: https://www.upv.es More videos at:    / valenciaupv   Access our MOOCs: https://upvx.es #Connections #Access Matrix #Connected Components #Undirected Graph