## Overview
The routing_dijkstra service obtains the graph created by graph_builder service from the GCP Cloud Storage. A modified K-Shortest Dijkstra with Priority Queue is used to find 3 shortest paths between 2 coordinates.

## Process Description
- Downloading DB from Cloud Storage
- [Finding 5 closest nodes from src and des respectively](./Finding-Nearest-Node-or-Road)
- [Multi-threaded routing](./Multithreading-Routing-Algorithm) from each combination of src and des to find [3 shortest paths](./Routing-Algorithm)
- Return 3 shortest routes