Discrete Mathematics 5: Graphs and Eulerian Paths
Channel:
Subscribers:
157
Published on ● Video Link: https://www.youtube.com/watch?v=2QKjZb9ZKYg
In this video, I'll be covering graphs, one of my favorite topics in discrete mathematics. The next few videos will also be related to graphs, because the topic is pretty big, and really important for computer programming. This is just an introduction to the topic.
Also, I go through a really fast proof of Eulerian Paths. I don't want to slow down too much to explain proofs, so hopefully it made sense, but if not, you should take away that there are things we can prove about certain types of graphs, and they can help us solve practical problems such as whether we can cross bridges without having to see the same view twice.
Other Videos By Meerkov
2016-04-17 | [TAS] Pinocchio in 16:24 by Meerkov |
2016-04-04 | [TAS] Bible Buffet Speed Run 3:02 |
2015-10-06 | [TAS] Cratermaze in 58:53.93 by Meerkov |
2015-01-11 | Programming - 1 Integers and Floats |
2014-10-26 | Programming - 0.1 Command Line and Windows Setup |
2014-10-26 | Programming - 0 Setup Python |
2014-10-11 | Discrete Mathematics 7: Combinations and Permutations |
2014-09-13 | Discrete Mathematics 6: Trees and Traversal |
2014-09-04 | Simply Skyrim 1 - Go Tell the Jarl [No Commentary, Edited] |
2014-09-04 | Simply Skyrim 0 - Intro [No Commentary + Edited] |
2014-04-09 | Discrete Mathematics 5: Graphs and Eulerian Paths |
2014-04-02 | Discrete Mathematics 4: Matrix Math |
2014-03-30 | Discrete Mathematics 3: Sets and Quantifiers |
2014-03-30 | Discrete Mathematics 2: Formal Logic |
2014-03-30 | Discrete Mathematics 1: Intro and Binary |
Tags:
Eulerian Path (Mathematical Concept)
Graph
Discrete Mathematics
Mathematics (Programming Language Paradigm)
isomorphism
cliques
cycles