This project is Microservice of Dijkstra's Shortest Path First algorithm.
$ mkdir build
$ cd build
$ conan install ..
$ cmake ..
$ cmake --build .
$ ./bin/spfservice_unittest
$ ./bin/spfservice_benchmark
$ ./bin/spfservice
{"action": "AddVertex"}
{"id": "<Number>"}
{"action": "RemoveVertex", "id": <Number>}
{}
Note: all edges of the vertex are removing.
{"action": "AddEdge", "from": <Number>, "to": <Number>, "weight": <Number>}
{}
{"action": "RemoveEdge", "from": <Number>, "to": <Number>}
{}
{"action": "GetPath", "from": <Number>, "to": <Number>}
{"ids": ["<Number>", ...]}
{"error": "<String>"}