Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Graph Theory

The course is not on the list Without time-table
Code Completion Credits Range
11WTG KZ 4 6
Lecturer:
Tutor:
Supervisor:
Department of Applied Mathematics
Synopsis:

Simple graphs, multigraphs, labeled graph, planar graph, Euler´s formula. Four-color problem. Euler Circuit, Hamilton circuit and directed graphs. Algorithms for finding distances in digraphs - Dijkstra´s algorithm. Weighted graphs, shortest paths and minimal spanning trees. A depth first spanning tree, a breadth first spanning tree. Adjacency matrices. Flows in networks.

Requirements:
Syllabus of lectures:
Syllabus of tutorials:
Study Objective:
Study materials:
Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2019-10-16
For updated information see http://bilakniha.cvut.cz/en/predmet24342705.html