Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-GALAcad. year: 2013/2014
This course discusses graph representations and graphs algorithms for searching (depth-first search, breadth-first search), topological sorting, graph components and strongly connected components, trees and minimal spanning trees, single-source and all-pairs shortest paths, maximal flows and minimal cuts, maximal bipartite matching, Euler graphs, and graph coloring. The principles and complexities of all presented algorithms are discussed.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
branch MBS , 0 year of study, winter semester, electivebranch MIN , 0 year of study, winter semester, electivebranch MIS , 0 year of study, winter semester, electivebranch MMI , 0 year of study, winter semester, electivebranch MMM , 0 year of study, winter semester, compulsorybranch MPV , 0 year of study, winter semester, electivebranch MBI , 0 year of study, winter semester, electivebranch MGM , 0 year of study, winter semester, electivebranch MSK , 1 year of study, winter semester, compulsory-optional
Lecture
Teacher / Lecturer
Syllabus
Project