Paths, Connectivity, and Trees
Algorithmically Speaking - #12: An introduction to foundational concepts in the graph theory field.
Hello there, and welcome to a new edition of Algorithmically Speaking!
As is usually the case with all fields of knowledge, it is virtually impossible to progress and push the limits if one lacks a theoretical basis supporting more significant discoveries. It is often the case that particularly challenging problems donβt need particularly challenging solutions but clever applications of basic definitions.
In todayβs discussion, I want to present some of these fundamental concepts in graph theory, hoping that they will help you lay the foundations for understanding more complex topics in future editions.
In order, this is our agenda for today:
π― Basic Definitions β an introduction to fundamental definitions of graph theory.
π₯¨ Paths and Connectivity β an introduction to one of the most valuable applications of graphs, finding paths.
π³ Trees β an introduction to a specific type of graph, trees.
This article is part of a chapter on Fundamental Definitions of graph theory in my upcoming book, β¦
Keep reading with a 7-day free trial
Subscribe to Algorithmically Speaking to keep reading this post and get 7 days of free access to the full post archives.