Help with A* Pathfinding

[SCB3]

So basically I am trying to read in from a text file to read through and find the best path via A*.
The problem I have now, I have the text files reading in just fine, but not sure how to now use them in a A* algorithm and output the results.
So far I have the text file in a class:

class Map 
{
    int x, y;
    int mArray[10][10];
public:
    Map()
    {
        ifstream infile;
        infile.open("map.txt");
        if (!infile)
        {
            cout << "Cannot open File";
            exit(1);
        }
        while (!infile.eof())
        {
            for (int i = 0; i < 10; i++)
            {
                for (int j = 0; j< 10; j++)
                {
                    infile >> mArray[i][j];
                }
            }
        }
        infile.close();
    }
};

So what's next?

[Nico]

I think
step 2: getting the start and finish points
step 3: coming up with an estimation for the costs to go from start to finish
step 4: implementing the search algorithm
step 5: testing and improving the estimations

Have a look here: http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html
for some interesting explanation and guidelines.