Скачать или смотреть Indegree and Outdegree in Directed Graphs | Graph Theory

Support the production of this course by joining Wrath of Math to access all my graph theory videos!
   / @wrathofmath  
🛍 Check out the coolest math clothes in the world: https://mathshion.com/

Graph Theory course:    • Graph Theory  
Graph Theory exercises:    • Graph Theory Exercises  

Get the textbook! https://amzn.to/3HvI535

We describe the indegrees and the outdegrees of vertices in directed graphs in detail, with examples and practice problems. Recall in a digraph edges have direction, and so are called directed edges or "arcs". These are represented by ordered pairs of vertices like (u,v). The arc (u,v) goes from u and to v. The outdegree of a vertex is the number of arcs going out of it, the indegree of a vertex is the number of arcs going to it (or into it, if you prefer). #GraphTheory

★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits:   / wrathofmathlessons  
◆ Donate on PayPal: https://www.paypal.me/wrathofmath

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