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, …
