Graphs: models, algorithms and processes

information and communication technology

intermediate

(in Polish) WYKLAD I1_W16, I1_U18

LABORATORUM I1_W16, I1_U18

java programming would be a plus

The aim of this course is to provide students some knowledge about algorithmic aspects of graph theory. They will learn how to generate graphs, how to design and implement algorithms operating on them and how to perform relevant measures. A graph library (GraphStream) is used to facilitate the implementation of algorithms in java.

LECTURE

Student:

W1: knows graph vocabulary, main graph families with their characteristics,

W2: knows fundamental graph algorithms,

W3: knows main problems related to graphs,

W4: knows what random walks are and some basic properties,

U1: can design and implement algorithms operating on graphs.

LABORATORIES

Student:

U1: can use a java library for creating graphs.

U2: can model a problem as a graph.

U3: can design and implement specific algorithms for graphs.

W1: knows processes for generating graphs.

For all learning outcomes, the following assessment criteria are adopted for all forms of verification:

grade 5: fully achieved (no obvious shortcomings),

grade 4.5: achieved almost fully and criteria for awarding a higher grade are not met,

grade 4: largely achieved and the criteria for a higher grade are not met,

grade 3.5: largely achieved - with a clear majority of positives - and the criteria for granting a higher grade are not met,

grade 3: achieved for most of the cases covered by the verification and criteria for a higher grade are not met,

grade 2: not achieved for most of the cases covered by the verification.