I have an assignment in my university where I have to implement Uniform Cost Search and A* Search.
We have an input which includes a map and queries.
The map is weighted, directed graph, represented by an adjacency matrix. The queries include Uniform Cost Search and A* Search queries (Ex:
Uniform(or A*) + initial location + goal location)
I cannot use heuristic functions based on physical distance because we have no knowledge and extra information about this graph except distances between vertices.
Is there any way to find a heuristic function in this case ?
(Is it possible to use prior results from Uniform Cost Search in the queries to extract information from the graph?)