Do the 3rd part only (A* search algorithm) in C++

Oradea Neamt 87 Zerind 75 151 D lasi Arad - 140 92 Sibiu 99 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 211 97 Pitesti 98 146 85 Hirsova 101 Lugoj 70 Mehadia 75 Dobreta 120 Urziceni 138 86 Bucharest 90 Craiova Eforie Giurgiu Consider the above mentioned graph. Cities represent the vertices and values on the edges represent the cost for moving from one vertex to other. Implement the following search algorithms for this undirected graph. 1. Dijkstra's Algorithm 2. Kruskal's Algorithm 3. A* Search Algorithm