I am implementing BFS, A*....

I got confused by all the terms used in the books. Like, what would be th difference between a search node and a state node, or a search tree and a search graph?

I have two files as input, a nodes file (coordinate with id per line) and actions file (id of start node id of end node and path cost per line). Is the state node the coordinates with id for a node? What would be the search node?

Also the problem is defined by a start and a goal state( nodes with ids)

How should I implement this information?


You can find a lot of material on coding up BFS on the net. What language are you going to code it in? If you have tried something, post in the relevant forum and you would get a lot more specific help. And try to explain it better.