Kind of late and I'm not even sure what you're asking but here goes.
I assume you have a character on a map and you want to click him and then all the possible tiles will be highlighted? I'm not even sure if this is the best way but I'd treat each tile as a node and each tile will be connected through an edge. So we'd have a graph and each node that character is NOT able to travel on, I'd simply treat as a node with no connecting edges and give it a sprite (rock for example).
So now, when you click on your character, you run a shortest path algorithm. I'd use Dijkstras, so after the algorithm is run you'd have an array of visited nodes and if it CAN be visited, it WILL be visited so therefore whichever nodes have been visited, these are the possible places your character can go and you simply highlight them.
I've written dijkstra's in n^2 so it shouldn't be too hard. This is also good because it becomes REALLY easy to change tiles to unvisitable tiles, and even get fancy with having your character travel in a certain path. Like make some paths more expensive then others and your character will automatically take the best path :)
Again, I'm not sure if this is what you want. Or if this is even the best way. Let me know if you need help for the algorithm, or if you did it a different way, I'll be curious to see how.