What's the Deal with Graphs? | Trees and Graphs for Faster Code Part 1

Sign up for DUTC Weekly: https://mailchi.mp/dutc/ytweekly

LinkedIn: https://www.linkedin.com/company/dont-use-this-code
Website: https://www.dontusethiscode.com/index...
Upcoming events: learning.dutc.io
Looking for training? Contact info@dutc.io

Abstract
In this series, we discuss the theory underlying trees and graphs, limiting ourselves to modeling these structures (fairly inefficiently) using NetworkX and focus on the various operations and algorithms that can be encoded in terms of this structure.
We aim to answer the following questions:
• What is a graph? What are the different subtypes of graphs? How does NetworkX model graphs? (Is a MultiDiGraph a real thing?)
• What are the standard traversals? How are they related?
• What is path-finding?
• What is coloring?
• What is bipartite matching?
• What is min/max flow?

You don’t need a Computer Science degree to be a good programmer. In fact, some of the best programmers out there are folks with no formal CS training!
But this doesn’t mean that the knowledge and the topics covered in a CS degree are not useful. In fact, your typical Computer Science degree covers quite a bit of theory that is useful and applicable to common programming tasks.

Are you looking to build a stronger foundational theoretical understanding of computing?

Are you looking for a condensed view of some of the major topics that would be covered in a CS degree?

Are you looking for hands-on application of these topics to concrete programming problems?
… if so, then you’re going to want to join us for this series!

We look at tree and graph theory and see how these provide a framework for solving a variety of common problems.

Видео What's the Deal with Graphs? | Trees and Graphs for Faster Code Part 1 канала Don't Use This Code • James Powell