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 ...

Parallel BFS This project is a parallel implementation of the Breadth-First Search (BFS) algorithm for graph traversal using CUDA programming on NVIDIA GPUs. The goal is to improve the performance of ...

For the shortest path problem of cyclic directed fully connected layer graph in several cycles, there is no excellent general solution algorithm in the literature. In this paper, we address this ...

In this paper, the convolution behavior recognition algorithm of multi-stream spatio-temporal graph based on Transformer fusion is proposed, and an innovative spatiotemporal self-attention unit is ...