TCP server implementation with simple string protocol.
Server accepts string commands which allows adding and removing nodes and edges to graph.
Additionally, it allows also finding the shortest path in graph and finding nodes closer than given radius from specified node.
These two features are implemented using Dijkstra algorithm.
gradlew clean build
java -jar graph-server-1.0-SNAPSHOT.jar