Last Minute Lecture

Defusing Counterwill in ADD: Nine Keys to Restoring Connection and Cooperation | Chapter 21 of Scattered Minds by Gabor Maté Welcome to Last Minute Lecture’s summary of Chapter 21 from Scattered Minds by Dr. Gabor Maté. This chapter offers parents and caregivers a practical, compassionate guide to diffusing counterwill—the instinctive resistance children (especially those with ADD) display when they feel controlled or unsafe. Healing begins with connection, not control. Watch the full video summary below, and subscribe to Last Minute Lecture for more trauma-informed, psychology-based chapter guides and family support: Subscribe to Last Minute Lecture for chapter-by-chapter textbook summaries and expert parenting insights. Counterwill: Normal, Not Pathological Dr. Maté explains that counterwill is a natural drive to protect autonomy, not a sign of bad character or deliberate defiance. It is triggered when attachment is threatened, and is especially strong in sensitive, AD...

Minimum Spanning Trees — Kruskal’s & Prim’s Algorithms Explained | Chapter 21 in Introduction to Algorithms Chapter 21 of Introduction to Algorithms (CLRS) dives deep into one of the most elegant and widely used topics in graph theory: the minimum spanning tree (MST). MST algorithms are essential in network design, clustering, and optimization problems. This chapter introduces the MST problem, explains the greedy strategy behind its solutions, and breaks down two classic algorithms—Kruskal’s and Prim’s—used to efficiently construct MSTs. 📺 Watch the video above for a podcast-style walkthrough, or read below for a complete written summary and key definitions you need to understand this foundational algorithmic concept. What Is a Minimum Spanning Tree? A minimum spanning tree is a subset of a graph’s edges that connects all the vertices together without forming cycles and with the least possible total edge weight. The MST of a connected, undirected, weighted graph ensur...