Help Finishing Java - Prolog Code

I want to write a code that uses A star algorithm for getting minimum distance. Imagine as an example you have 10 taxis and a client and you want to find the one that is closer. You calculate the minimum distance with A star algorithm. Most of the project is already done, we need the last smallest part. You get map data from openmaps (coordinates) which you use as nodes. Already Done: Full Java code for the first part full of comments. Parses all the data, calculates A star, writes them in KML. Considers that all roads are accessible and 2 way. Needs to be slightly changed. Connection with Prolog ready. All datasets fully accessible and easily manipulated. ToDo: The new CSV files are in the repository (I will send you the link) in the ToDo folder. 1) First you find with prolog which taxis can serve this client (very easy part, you compare if they speak the same language, if they have enough seats for the passengers that the client requested ets) 2) From the taxis that fill these requirements you find the distance to the client with A star (already done) and you decide which one is the right one A Star Changes: 1) now it sees all roads as 2 way streets. But now with the new data some roads are one way or dead ends or river etc, so you need to alter a bit A star not to take this road. 2) Some roads have high traffic, so the heuristic estimation might alter a bit according to that..for example you might make heruristic estiamtion two times bigger if there is high traffic More information in the files attached. Part 1 is completed. Part 2 is what you have to do. Feel free to ask any question.