Let's say I have a graph using strings, such as locations. I want to be able to get from
x to y in the shortest path possible. X and Y are user defined.
I've never used BFS, but I've seen some samples online. However, these all used integers as data and I'm not sure how to implement it using strings. I know you have to implement a Queue
BFS doesn't really change from data type to data type since you are only trying to find the shortest path. What specifically are you having trouble doing?
perhaps you should look at http://en.wikipedia.org/wiki/Breadth-first_search it has pseudo code that you should be able to adapt fairly easily and it actually has examples about using it on german cities.