private void DFSUtil(Graph.Vertex V, ref int timestamp, ref List <int> stopstamp, ref List <bool> visited, ref StreamWriter sw)
{
int j;
int i = V.GetIndex();
visited[i] = true;
timestamp++;
sw.WriteLine(V.data + "," + timestamp);
foreach (string vertexname in graph.GetNeighbor(V.data))
{
j = graph.GetVertexIndex(vertexname);
sw.WriteLine("(," + V.data + "," + vertexname);
if (!visited[j])
{
DFSUtil(graph.GetVertex(j), ref timestamp, ref stopstamp, ref visited, ref sw);
}
}
timestamp++;
sw.WriteLine(">," + V.data + "," + timestamp);
stopstamp[i] = timestamp;
}
public void BFS()
{
int [] visitCounter = new int[graph.GetGraphSize()];
bool[] visited = new bool[graph.GetGraphSize()];
for (int i = 0; i < graph.GetGraphSize(); i++)
{
visitCounter[i] = 0;
visited[i] = false;
}
List <string> result = new List <string>();
Graph.Vertex root = graph.GetVertex(graph.GetRootIndex());
Queue <string> queue = new Queue <string>();
List <string> neighbors = graph.GetNeighbor(root.data);
visited[graph.GetVertexIndex(root.data)] = true;
System.IO.File.WriteAllText("BFS.dat", root.data + Environment.NewLine);
string strNeighbors = "";
foreach (var vertex in neighbors)
{
queue.Enqueue(vertex);
strNeighbors = strNeighbors + vertex + ",";
visitCounter[graph.GetVertexIndex(vertex)]++;
}
System.IO.File.AppendAllText("BFS.dat", strNeighbors + Environment.NewLine);
while (queue.Count != 0)
{
string visit = queue.Dequeue();
if (!visited[graph.GetVertexIndex(visit)])
{
neighbors = graph.GetNeighbor(visit);
System.IO.File.AppendAllText("BFS.dat", visit + Environment.NewLine);
strNeighbors = "";
foreach (var vertex in neighbors)
{
queue.Enqueue(vertex);
strNeighbors = strNeighbors + vertex + ",";
visitCounter[graph.GetVertexIndex(vertex)]++;
}
System.IO.File.AppendAllText("BFS.dat", strNeighbors + Environment.NewLine);
visited[graph.GetVertexIndex(visit)] = true;
}
if (queue.Count == 0)
{
for (int i = 0; i < graph.GetGraphSize(); ++i)
{
if (!visited[i])
{
queue.Enqueue(graph.GetVertex(i).data);
break;
}
}
}
}
string resSeq = "";
bool finish;
do
{
finish = true;
int i = 0;
int min = graph.GetGraphSize();
int pos = -1;
while (i < graph.GetGraphSize())
{
if (visitCounter[i] != -1 && visitCounter[i] < min)
{
min = visitCounter[i];
pos = i;
finish = false;
}
i++;
}
if (!finish)
{
string data = graph.GetVertex(pos).data;
result.Add(data);
neighbors = graph.GetNeighbor(graph.GetVertex(pos).data);
foreach (var vertex in neighbors)
{
visitCounter[graph.GetVertexIndex(vertex)]--;
}
visitCounter[pos] = -1;
}
} while (!finish);
if (this.result == null)
{
this.result = result;
}
resSeq = "";
for (int i = 0; i < graph.GetGraphSize(); ++i)
{
resSeq = resSeq + result[i] + ",";
}
System.IO.File.AppendAllText("BFS.dat", resSeq + Environment.NewLine);
}