Given a directed graph and a source vertex, the fully dynamic BFS problem is to maintain the BFS tree rooted in the source vertex, subject to edge deletions and insertions. A very basic solution to the problem is to use static BFS: we do not maintain any information and start the pure, static algorithm for each query anew from the source. However, there are more efficient solutions presented in  the work [2]. The goal of the thesis is to present up-to-date algorithms for maintaining  BFS trees in a directed graph, to implement the algorithms and to conduct an experimental evaluation to show the efficiency of different algorithms.  The library of dynamic graphs [3] should be used for the evaluation. 

The created code will be publicly available in the IS under the MIT license.