LDACS-Dijkstra is a component of the LDACS-Greedy-K-Hop-Simulator project. It implements Dijkstra's shortest path routing and is used as an upper bound for PDR in the simulation
Clone the repository and follow the setup instructions:
git clone https://github.com/ComNetsHH/LDACS-Dijkstra.git
cd LDACS-Dijkstra/simulation
make build-releases