using BFS to find shortest path.

[MMhawk607]

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

#include <string>
#include <iomanip>
#include <iostream>

using namespace std;

struct node
{
	string info;
	node *next;
};
class Queue 
{
private:
	node *front;
	node *rear;
public:
		Queue();
		~Queue();
		bool isEmpty();
		void enqueue(string);
		string dequeue();
		void display();
};
Queue::Queue()
{
	front = NULL;
	rear = NULL;
}
Queue::~Queue()
{
	delete front;
}

void Queue::enqueue(string data)
{
	node *temp = new node();
	temp->info = data;
	temp->next = NULL;
	if(front == NULL)
	{
		front = temp;
	}
	else
	{
		rear->next = temp;
	}
	rear = temp;
}

string Queue::dequeue()
{
	node *temp = new node();
	string value;
	if(front == NULL)
	{
		cout<<"Queue is empty"<<endl;
	}
	else
	{
		temp = front;
		value = temp->info;
		front = front->next;
		delete temp;
	}
	return value;
}

bool Queue::isEmpty()
{
	return(front == NULL);
}

how would I go writing the BFS? Not asking anyone to write it for me, just need a general direction since I am a beginner. I'm sort of stuck.

Thanks.

[MMhawk607]

Oh forgot to include that I already have the Graph implemented. Such as existsEdge, addEdge, addVertex. vertexList, adjacencyList. I can include it in the code if anyone needs me too.

[MMhawk607]

bump.

[K0T4K0t4]

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.