Algorithms in Graph TheoryLaajuus (3 ECTS)

Objective

Often we would like to travel from one place to another. If we are by car, then TomTom will help us. If we send a mail, then routers will help us. Algorithms in Graph theory will do the work.

In this course we will look at concepts of Graph Theory to understand the algorithms, so we can apply them in IT.
• Know and understand the concepts of Graph Theory.
• Know and understand the Dijkstra, Posa, Bellman-Ford, and Balanced Graph algorithms.
• Implement these algorithms in IT.

Content

1 Foundations
2 Extentsions
3 Networktraversal
4 Trees
5 Social Networks

Qualifications

Students must have basic knowledge of programming.

Assessment criteria, satisfactory (1)

All exercises will have to be made, the code must be submitted and a small report with explanation should be written and handed in. Approval for all assignments by the teacher will be necessary to obtain the 3 ECTS.

Assessment criteria, good (3)

-

Assessment criteria, excellent (5)

-

Assessment criteria, approved/failed

All exercises will have to be made, the code must be submitted and a small report with explanation should be written and handed in. Approval for all assignments by the teacher will be necessary to obtain the 3 ECTS.