Different implementation of algorithms (greedy, shortest path, Monte Carlo Tree Search, SARSA, etc..) for Quantum Internet Routing. Still under construction...
- Python 3.6+
 - NetworkX
 
pip install -r requirements.txtThe following command will run a benchmark on a cycle networks.
python src/benchmark.py \
    --epochs 10 \
    --n 8 \
    --dth 3 \
    --mcts_sim_num 500 \
    --c_ucb1 2