Graphs, Trees, and Spreading Disease - MIT 18.S191 Fall 2020 Week 5

Graphs, Trees, and Spreading Disease - MIT 18.S191 Fall 2020 Week 5

The Julia Programming Language via YouTube Direct link

Function for Breadth first search queue

11 of 19

11 of 19

Function for Breadth first search queue

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Graphs, Trees, and Spreading Disease - MIT 18.S191 Fall 2020 Week 5

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 What is a graph?
  3. 3 Creating trees
  4. 4 How to traverse the tree?
  5. 5 Idea of Depth first Search
  6. 6 Idea of Breadth first Search
  7. 7 Depth first search recursive scheme
  8. 8 Different ways in which we can recurse through the tree
  9. 9 How stacks and queues work?
  10. 10 Function for Depth first search stack
  11. 11 Function for Breadth first search queue
  12. 12 How to extend this to SIR model
  13. 13 Nicky Case simulation
  14. 14 Classes in SIR model of infection spreading
  15. 15 Script
  16. 16 Plot the tree
  17. 17 Discussion about LightGraphs in Julia
  18. 18 Welcome!
  19. 19 Help us add time stamps or captions to this video! See the description for details.

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.