20.500.12556/DKUM-96580 Analysis of the Shortest Path Method Application in Social Networks This paper analyzes the shortest path problem (SPP) in social networks, based on the investigation and implementation of different methods on a simulated example. The objectives of the paper include identification of the most commonly used methods for finding the shortest path in a social network as a strategic attempt to speed the search of network nodes, focusing on the application of the two most used SPP methods: the Dijkstra and Bellman-Ford algorithms. A comparative analysis is used as an investigation method for performance evaluation of different algorithms, based on their implementation and behavior, tested on a social network example. The research results indicate that the Dijkstra algorithm is faster, and therefore more suitable for searching the shortest connection in social networks. social networks social networks analysis shortest path problem Dijkstra algorithm Bellman-Ford algorithm optimization of search socialna omrežja algoritmi optimizacija true false true IOS Press Angleški jezik Slovenski jezik https://ebooks.iospress.nl/ © 2023 The authors and IOS Press Znanstveno delo 2026-01-20 08:49:07 2026-01-20 08:49:07 2026-01-22 03:06:03 0000-00-00 00:00:00 2023 0 0 Str. 169-182 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2023-01-01 004.6 139866371 139872259 FAIA-364-FAIA220500.pdf FAIA-364-FAIA220500.pdf 1 CB2B9FCAA573AF85ECF0D3A4FD26E5D0 d7feddff49e5c298eabdf7ae8db7d5e3bb22aed7a8ec34d37706aaf6441d6ff6 b5cd8c16-f5d4-11f0-8ae2-00155d580e02 https://dk.um.si/Dokument.php?lang=slv&id=202237 https://ebooks.iospress.nl/volumearticle/62727 0 bb725fdd-f5d4-11f0-8ae2-00155d580e02 https://dk.um.si/Dokument.php?lang=slv&id=202238 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0