filmov
tv
Discrete Math II - 11.4.1 Spanning Trees - Depth-First Search
Показать описание
We continue our study of trees by examining spanning trees. Spanning trees are subgraphs of a graph that contain all vertices of the original graph. The resulting subgraph is a tree, so the graph is connected and contains no cycles.
In our first methodology, we will use a depth-first search. That means that we will begin creating our spanning tree by choosing a specific vertex starting point, then follow that path until we can no longer reach any unvisited vertices. We will then backtrack through the vertices to visit any remaining unvisited vertices.
Video Chapters:
Intro 0:00
What is a Spanning Tree 0:11
Depth-First Search/Backtracking Method 1:15
Using a Stack 4:00
Practice 6:42
Up Next 8:27
In our first methodology, we will use a depth-first search. That means that we will begin creating our spanning tree by choosing a specific vertex starting point, then follow that path until we can no longer reach any unvisited vertices. We will then backtrack through the vertices to visit any remaining unvisited vertices.
Video Chapters:
Intro 0:00
What is a Spanning Tree 0:11
Depth-First Search/Backtracking Method 1:15
Using a Stack 4:00
Practice 6:42
Up Next 8:27
0:03:20
Composition of relations | MISTAKE - explained RoS instead of SoR and vice versa | otherwise correct
0:03:51
Solving congruences, 3 introductory examples
0:05:45
What does a ≡ b (mod n) mean? Basic Modular Arithmetic, Congruence
0:13:35
COMBINATIONS with REPETITION - DISCRETE MATHEMATICS
0:20:49
Discrete Math II - 8.5.1 The Principle of Inclusion-Exclusion
0:19:28
Discrete Math II - 6.4.1 The Binomial Theorem
0:13:51
Discrete Math II - 8.4.1 Readiness for Generating Functions: Model with Generating Functions
0:07:34
Nested Quantifiers (Solved Example 1)
0:07:32
Can you solve this? | Oxford entrance exam question | iota maths problem
0:13:03
Discrete Math II - 11.5.1 Minimum Spanning Trees: Prim's Algorithm
0:19:06
Discrete Math II - 6.5.1 Combinations with Repetition
0:02:42
Hasse Diagram with Example (Discrete Mathematics) Order relation & Lattice
0:16:22
Discrete Math II - 5.2.1 Proof by Strong Induction
0:05:51
Representation of Relations
0:13:01
Discrete Math II - 5.1.1 Proof by Mathematical Induction
0:17:19
Discrete Math - 11.1.1 Introduction to Trees
0:07:32
Proof by Mathematical Induction - How to do a Mathematical Induction Proof ( Example 1 )
0:00:48
MIT Entrance Exam Problem from 1869 #Shorts #math #maths #mathematics #problem #MIT
0:06:29
Equivalence Relation
0:00:19
Introductory Discrete Mathematics by V.K. Balakrishnan
0:05:05
Quantifiers
0:09:02
Discrete Math II - 8.6.4 Apply the Principle of Inclusion Exclusion: Derangements
0:07:39
Introduction to Relations
0:07:51
Truth Table Tutorial - Discrete Mathematics Logic
Комментарии