Describe the implementation of the A* search algorithm for a weighted graph with non-uniform edge costs. Include details on the heuristic function selection and how it guarantees optimality. Discuss the time complexity trade-offs compared to Dijkstra's algorithm in the context of a sparse graph.