Write a Java or python program to implement the task below that focuses on Greedy breadth-first search, A* Algorithm, DFS, BFS, uniform cost search algorithm.

Write a Java or python program to implement the task below. For details, see Table-1in the below document attached. When implementing algorithms, these algorithms choose the travel nodes based on cost functions. In other words, you cannot manually design the roadmap. In program codes, you only choose Array, LinkedList, Stack, (Priority) Queue, or recursive functions to write codes. You shouldn’t use a hash table, dictionary, or other structures. Please see attached document for more details.