Přístupnostní navigace
E-application
Search Search Close
Course detail
FSI-9GRAAcad. year: 2023/2024
The course focuses on graph theory and familiarises students with fundamental terms and algorithms. It deals with the following topics: Graph representation. Time complexity of algorithms. Data structures (binary heap, disjoint sets, ...). Eulearian trails, Hamiltonian paths. Breadth-first searching, depth-first searching, backtracking, branch and bound method. Connectivity and reachability. Shortest path problems (Dijkstra's algorithm, Floyd-Warshall algorithm). Network graphs. Trees, spanning tree problem, Steiner tree problems. Fundamentals of computational geometry - visibility graphs, Voronoi diagrams, Delaunay triangulation. Network flows. Graph colouring. Graph matching.
Language of instruction
Mode of study
Guarantor
Department
Entry knowledge
Rules for evaluation and completion of the course
Aims
Study aids
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
Lecture
Teacher / Lecturer
Syllabus