Курс: Algorithms and Datastructures I English, Тема: Minimum spanning trees | DL 1

DL 1

В начало

Section outline

- Select activity Post questions/discussion/pointers to good study materials here Fórum
  
  Post questions/discussion/pointers to good study materials here Fórum Форум
  
  Students must
  
  Mark as done
- Select activity Slides (same as for previous topic)
  
  Slides (same as for previous topic) Гиперссылка
  
  Students must
  
  Mark as done
- Select activity Recorded lecture (same as for previous topic; see table of contents on the bottom)
  
  Recorded lecture (same as for previous topic; see table of contents on the bottom) Гиперссылка
  
  Students must
  
  Mark as done
- Select activity Jarník (Prim) algorithm on wikipedia
  
  Jarník (Prim) algorithm on wikipedia Гиперссылка
  
  Students must
  
  Mark as done
- Select activity Borůvka algorithm
  
  Borůvka algorithm Гиперссылка
  
  Students must
  
  Mark as done
- Select activity Kruskal's algorithm
  
  Kruskal's algorithm Гиперссылка
  
  Students must
  
  Mark as done
- Select activity Homework (minimum spanning tree)
  
  Homework (minimum spanning tree) Задание
  
  Students must
  
  Mark as done
  
  Simple moodle homework for my practicals (others can post answers too and I will comment them):
  
  Prove that every minimum spanning tree contains every bridge.