M015 Graph Algorithms

Faculty of Informatics
Spring 1999
Extent and Intensity
2/1. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. RNDr. Libor Polák, CSc. (lecturer)
Guaranteed by
Contact Person: doc. RNDr. Libor Polák, CSc.
Prerequisites
Before enrolling this course the students should go through M010 Combinatorics and Graph Theory.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Elementary graph algorithms (representations of graphs, breadth-first search, depth-first search, topological sort, strongly connected components).
  • Minimum spanning trees (growing a minimum spanning tree, the algorithms of Kruskal and Prim).
  • Single-source shortest paths (shortest paths and relaxation, Dijkstra's algorithm, the Bellman--Ford algorithm, single--source shortest paths in directed acyclic graphs).
  • All-pairs shortest paths (shortest paths and matrix multiplication, the Floyd-Warshall algorithm, Johnson's algorithm for sparse graphs).
  • Maximum flow (flow networks, the Ford-Fulkerson method, maximum bipartite matching).
  • Data structures for graph algorithms (binary heaps, priority queues, binomial heaps, data structures for disjoint sets).
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Spring 1996, Spring 1997, Spring 1998, Spring 2000, Spring 2001, Spring 2002.
  • Enrolment Statistics (Spring 1999, recent)
  • Permalink: https://is.muni.cz/course/fi/spring1999/M015