c++ A* in grid game
===

I have grid for game ( cells are enumerated in pairs of integer like in matrix). Every cell has different cost of crossing ( from 0 to 1000000 ). Can anyone suggest me A* implementation ( different than micropather) for finding path ?  My bots can step in small increment, not just to jump on next cell.