Explore graphs, trees, and disease spread modeling in this 28-minute lecture from MIT's 18.S191 Fall 2020 course. Learn about graph theory fundamentals, tree creation and traversal techniques, depth-first and breadth-first search algorithms, and their implementation using stacks and queues. Discover how these concepts apply to the SIR (Susceptible, Infected, Recovered) model for epidemic spread. Engage with interactive simulations and gain insights into plotting trees and using LightGraphs in Julia. The lecture covers various topics, including recursive schemes, infection spreading classes, and practical scripting examples. Participate in community efforts to improve video accessibility by adding timestamps and captions.
Graphs, Trees, and Spreading Disease - MIT 18.S191 Fall 2020 Week 5
The Julia Programming Language via YouTube
Overview
Syllabus
Introduction.
What is a graph?.
Creating trees.
How to traverse the tree?.
Idea of Depth first Search.
Idea of Breadth first Search.
Depth first search recursive scheme.
Different ways in which we can recurse through the tree.
How stacks and queues work?.
Function for Depth first search stack.
Function for Breadth first search queue.
How to extend this to SIR model.
Nicky Case simulation.
Classes in SIR model of infection spreading.
Script.
Plot the tree.
Discussion about LightGraphs in Julia.
Welcome!.
Help us add time stamps or captions to this video! See the description for details..
Taught by
The Julia Programming Language
