Sekce: Minimum spanning trees | Algorithms and Datastructures I English | DL 1

DL 1

Titulní stránka Podpora uživatelů

Osnova sekce

- Vybrat aktivitu Post questions/discussion/pointers to good study materials here Fórum
  
  Post questions/discussion/pointers to good study materials here Fórum
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Slides (same as for previous topic)
  
  Slides (same as for previous topic) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu 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) URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Jarník (Prim) algorithm on wikipedia
  
  Jarník (Prim) algorithm on wikipedia URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Borůvka algorithm
  
  Borůvka algorithm URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Kruskal's algorithm
  
  Kruskal's algorithm URL
  
  Studenti musí
  
  Označit jako hotovo
- Vybrat aktivitu Homework (minimum spanning tree)
  
  Homework (minimum spanning tree) Úkol
  
  Studenti musí
  
  Označit jako hotovo
  
  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.