This repository contains the source code for our paper: Simulation of Graph Algorithms with Looped Transformers. It includes the network implementations used to simulate the following graph algorithms: Breadth-First Search (BFS), Depth-First Search (DFS), Dijkstra's Shortest Path algorithm, and Kosaraju's Strongly Connected Components Algorithm (SCC).
To verify the empirical results of the paper, run the validation.ipynb file.