Metody výpočtu vzdálenosti v grafech

Abstract

My thesis focused on "Methods of calculating the distance in graphs". I will try to describe different methods for calculating the distance in the graphs in general. Just to mention it, for example the betweenes centrality, closeness centrality, degree centrality, etc. One of these methods is the median of a graph that I will focus later on. This calculation method will be described thoroughly and I will show you calculation of this method practically on an example. Furthermore, I will focus on the implementation of the algorithm regarding calculating the median in the programming language C#. In the next section I will deal with experiments of this calculation using graphs of different sizes. Eventually, I will analyze all the results.