Abstract: This study examines the performance of the Dijkstra and A* algorithms in uncovering the shortest path for strategic movement on the Sunset map in the game Valorant. Both algorithms were ...

Abstract: Efficient identification of influential nodes is crucial in complex networks due to its significant theoretical and practical implications for information propagation and various ...

This project is an exercise that forms part of the semester report in the Advanced Algorithms course. It introduces the basics of graphs and shortest path search algorithms for weighted graph, which ...