Hulk11/App-based-taxi-service

Simple project based on Dijkstra's algorithm. Given a list of vertices and a set of edges, this program makes a graph and manages customer requests. Customer initiates a taxi request to the base station, which eventually sends a taxi which is nearest to that customer at the time of request. Taxis are moving(means not static when free). Car Pooling not available. Customer's waiting time given priority.

Java