/*
Concept -
- we will give a vertex, and in this function we are going to calculate the diatance of
all other connected node, from this vertex.
Algo -
- First set the distance array to -1, for all the vertex.
*/
void ShortestPath(int vertex)
{
initializeArray();
m_distance[vertex] = 0; // distance to self is 0
MyQueue<char> q;
q.enQueue(m_graphLookup[vertex]);
char vertexTemp;
while (!q.isEmpty())
{
vertexTemp = q.deQueue();
for (int index = 0; index < m_vertex; ++index)
{
//if (m_matrix[vertex][index])
//{
// m_distance[index] =
//}
}
}
}
