C++ implementations of various graph algorithms such as: Graph Traversals (BFS, DFS), Topological Sort, Shortest Path, and Minimum Spanning Trees. I wrote my own implementations of these graph ...

This project is an implementation of several fundamental graph traversal and pathfinding algorithms in Java. It was completed as part of the CS 314: Data Structures course at The University of Texas ...

Abstract: Dijkstra’s shortest path algorithm is a fundamental graph search method widely used in domains such as navigation, robotics, gaming, and network routing. However, its performance can degrade ...

Abstract: The problem of cooperative behavior of a set of agents in an environment given by a directed state graph is considered. The task is to achieve the required balance between the length of the ...

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...

With the rapid development of mobile networks, location-based services have become deeply embedded in people's daily lives. Although the k-NN search problem has obtained a lot of research results, the ...