Strongly Connected Directed Graphs | Graph Theory, Digraph Theory

What are strongly connected digraphs? That's what we'll be going over in today's graph theory lesson. We'll recap connectedness, what it means to be weakly connected, and then finish off with the definition of strongly connected!

We say a directed graph D is strongly connected if, for every pair of vertices u and v in D, there is a u-v path and a v-u path, where the "paths" are directed. In other words, a directed graph D is strongly connected if every vertex is reachable from any other vertex.

Lesson on Connected graphs: https://www.youtube.com/watch?cv=z9cT...
Lesson on weakly connected digraphs:    • Weakly Connected Directed Graphs | Di...  
Lesson on underlying graphs:    • Underlying Graphs of Digraphs | Direc...  

◆ Donate on PayPal: https://www.paypal.me/wrathofmath
◆ Support Wrath of Math on Patreon:   / wrathofmathlessons  

I hope you find this video helpful, and be sure to ask any questions down in the comments!

********************************************************************
The outro music is by a favorite musician of mine named Vallow, who, upon my request, kindly gave me permission to use his music in my outros. I usually put my own music in the outros, but I love Vallow's music, and wanted to share it with those of you watching. Please check out all of his wonderful work.

Vallow Bandcamp: https://vallow.bandcamp.com/
Vallow Spotify: https://open.spotify.com/artist/0fRtu...
Vallow SoundCloud:   / benwatts-3  
********************************************************************

+WRATH OF MATH+

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu  
● Facebook:   / wrathofmath  
● Twitter:   / wrathofmathedu  

My Music Channel:    / seanemusic