ДепартаментИнформатика

Корпус 2, зала 702


Организатор:
Департамент „Информатика“


Лектор:
Виктория Христова

Модератор:
доц. д-р Ласко Ласков


The lecture is dedicated to description of our effort to implement and compare some of the best-known shortest paths algorithms in networks. Our comparative study focus on the details of the following algorithms and their implementation: Dijkstra's algorithm, A* and Yen's algorithm. Our research opens the possibility for more elaborated future work using different data structures to enhance network algorithms, and different programming languages implementations.


Виктория Христова, студент втора година в програма „Мрежови технологии“ (на английски език)